zcw-shared 1.21.0 → 1.22.0

package/dist/functions/algorithm/binarySearch.d.ts

@@ -0,0 +1,3 @@
+export declare function binarySearch(nums: number[], target: number): number;
+export declare function searchRotated(nums: number[], target: number): number;
+export declare function findPeakElement(nums: number[]): number;

package/dist/functions/algorithm/binarySearch.js

@@ -0,0 +1,58 @@
+export function binarySearch(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left <= right) {
+        const mid = Math.floor((left + right) / 2);
+        if (nums[mid] === target) {
+            return mid;
+        }
+        else if (nums[mid] < target) {
+            left = mid + 1;
+        }
+        else {
+            right = mid - 1;
+        }
+    }
+    return -1;
+}
+export function searchRotated(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left <= right) {
+        const mid = Math.floor((left + right) / 2);
+        if (nums[mid] === target)
+            return mid;
+        if (nums[left] <= nums[mid]) {
+            if (nums[left] <= target && target < nums[mid]) {
+                right = mid - 1;
+            }
+            else {
+                left = mid + 1;
+            }
+        }
+        else {
+            if (nums[mid] < target && target <= nums[right]) {
+                left = mid + 1;
+            }
+            else {
+                right = mid - 1;
+            }
+        }
+    }
+    return -1;
+}
+export function findPeakElement(nums) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left < right) {
+        const mid = Math.floor((left + right) / 2);
+        if (nums[mid] > nums[mid + 1]) {
+            right = mid;
+        }
+        else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}
+//# sourceMappingURL=binarySearch.js.map

package/dist/functions/algorithm/binarySearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binarySearch.js","sourceRoot":"","sources":["../../../src/functions/algorithm/binarySearch.ts"],"names":[],"mappings":"AAcA,MAAM,UAAU,YAAY,CAAC,IAAc,EAAE,MAAc;IACzD,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IAE3B,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1C,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,GAAG,CAAA;QACZ,CAAC;aAAM,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAA;QACjB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAA;AACX,CAAC;AAYD,MAAM,UAAU,aAAa,CAAC,IAAc,EAAE,MAAc;IAC1D,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IAE3B,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1C,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM;YAAE,OAAO,GAAG,CAAA;QAGpC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAE5B,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/C,KAAK,GAAG,GAAG,GAAG,CAAC,CAAA;YACjB,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;aAAM,CAAC;YAEN,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChD,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAA;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAA;AACX,CAAC;AAUD,MAAM,UAAU,eAAe,CAAC,IAAc;IAC5C,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IAE3B,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;YAE9B,KAAK,GAAG,GAAG,CAAA;QACb,CAAC;aAAM,CAAC;YAEN,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/functions/algorithm/canJump.d.ts

@@ -0,0 +1,2 @@
+export declare function canJump(nums: number[]): boolean;
+export declare function jump(nums: number[]): number;

package/dist/functions/algorithm/canJump.js

@@ -0,0 +1,27 @@
+export function canJump(nums) {
+    let maxReach = 0;
+    for (let i = 0; i < nums.length; i++) {
+        if (i > maxReach)
+            return false;
+        maxReach = Math.max(maxReach, i + nums[i]);
+        if (maxReach >= nums.length - 1)
+            return true;
+    }
+    return true;
+}
+export function jump(nums) {
+    let jumps = 0;
+    let currentEnd = 0;
+    let maxReach = 0;
+    for (let i = 0; i < nums.length - 1; i++) {
+        maxReach = Math.max(maxReach, i + nums[i]);
+        if (i === currentEnd) {
+            jumps++;
+            currentEnd = maxReach;
+            if (currentEnd >= nums.length - 1)
+                break;
+        }
+    }
+    return jumps;
+}
+//# sourceMappingURL=canJump.js.map

package/dist/functions/algorithm/canJump.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canJump.js","sourceRoot":"","sources":["../../../src/functions/algorithm/canJump.ts"],"names":[],"mappings":"AAqBA,MAAM,UAAU,OAAO,CAAC,IAAc;IACpC,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAErC,IAAI,CAAC,GAAG,QAAQ;YAAE,OAAO,KAAK,CAAA;QAG9B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAG1C,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAA;IAC9C,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAKD,MAAM,UAAU,IAAI,CAAC,IAAc;IACjC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAG1C,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;YACrB,KAAK,EAAE,CAAA;YACP,UAAU,GAAG,QAAQ,CAAA;YAGrB,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAK;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/functions/algorithm/climbStairs.d.ts

@@ -0,0 +1,2 @@
+export declare function climbStairs(n: number): number;
+export declare function minCostClimbingStairs(cost: number[]): number;

package/dist/functions/algorithm/climbStairs.js

@@ -0,0 +1,27 @@
+export function climbStairs(n) {
+    if (n <= 2)
+        return n;
+    let prev2 = 1;
+    let prev1 = 2;
+    let current = 0;
+    for (let i = 3; i <= n; i++) {
+        current = prev1 + prev2;
+        prev2 = prev1;
+        prev1 = current;
+    }
+    return prev1;
+}
+export function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    if (n <= 1)
+        return 0;
+    let prev2 = 0;
+    let prev1 = 0;
+    for (let i = 2; i <= n; i++) {
+        const current = Math.min(prev1 + cost[i - 1], prev2 + cost[i - 2]);
+        prev2 = prev1;
+        prev1 = current;
+    }
+    return prev1;
+}
+//# sourceMappingURL=climbStairs.js.map

package/dist/functions/algorithm/climbStairs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"climbStairs.js","sourceRoot":"","sources":["../../../src/functions/algorithm/climbStairs.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,WAAW,CAAC,CAAS;IACnC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAIpB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,OAAO,GAAG,CAAC,CAAA;IAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,OAAO,GAAG,KAAK,GAAG,KAAK,CAAA;QACvB,KAAK,GAAG,KAAK,CAAA;QACb,KAAK,GAAG,OAAO,CAAA;IACjB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAOD,MAAM,UAAU,qBAAqB,CAAC,IAAc;IAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAEpB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAClE,KAAK,GAAG,KAAK,CAAA;QACb,KAAK,GAAG,OAAO,CAAA;IACjB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/functions/algorithm/coinChange.d.ts

@@ -0,0 +1,2 @@
+export declare function coinChange(coins: number[], amount: number): number;
+export declare function coinChangeII(coins: number[], amount: number): number;

package/dist/functions/algorithm/coinChange.js

@@ -0,0 +1,25 @@
+export function coinChange(coins, amount) {
+    if (amount === 0)
+        return 0;
+    const dp = Array(amount + 1).fill(Infinity);
+    dp[0] = 0;
+    for (let i = 1; i <= amount; i++) {
+        for (const coin of coins) {
+            if (i >= coin) {
+                dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+            }
+        }
+    }
+    return dp[amount] === Infinity ? -1 : dp[amount];
+}
+export function coinChangeII(coins, amount) {
+    const dp = Array(amount + 1).fill(0);
+    dp[0] = 1;
+    for (const coin of coins) {
+        for (let i = coin; i <= amount; i++) {
+            dp[i] += dp[i - coin];
+        }
+    }
+    return dp[amount];
+}
+//# sourceMappingURL=coinChange.js.map

package/dist/functions/algorithm/coinChange.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coinChange.js","sourceRoot":"","sources":["../../../src/functions/algorithm/coinChange.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,UAAU,CAAC,KAAe,EAAE,MAAc;IACxD,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAG1B,MAAM,EAAE,GAAa,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACrD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAGT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAEjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBACd,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;AAClD,CAAC;AAMD,MAAM,UAAU,YAAY,CAAC,KAAe,EAAE,MAAc;IAE1D,MAAM,EAAE,GAAa,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC9C,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAGT,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;QACvB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,MAAM,CAAC,CAAA;AACnB,CAAC"}

package/dist/functions/algorithm/combinationSum.d.ts

@@ -0,0 +1 @@
+export declare function combinationSum(candidates: number[], target: number): number[][];

package/dist/functions/algorithm/combinationSum.js

@@ -0,0 +1,24 @@
+export function combinationSum(candidates, target) {
+    const result = [];
+    candidates.sort((a, b) => a - b);
+    function backtrack(start, path, sum) {
+        if (sum === target) {
+            result.push([...path]);
+            return;
+        }
+        if (sum > target) {
+            return;
+        }
+        for (let i = start; i < candidates.length; i++) {
+            const num = candidates[i];
+            if (sum + num > target)
+                break;
+            path.push(num);
+            backtrack(i, path, sum + num);
+            path.pop();
+        }
+    }
+    backtrack(0, [], 0);
+    return result;
+}
+//# sourceMappingURL=combinationSum.js.map

package/dist/functions/algorithm/combinationSum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinationSum.js","sourceRoot":"","sources":["../../../src/functions/algorithm/combinationSum.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,cAAc,CAAC,UAAoB,EAAE,MAAc;IACjE,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAEhC,SAAS,SAAS,CAAC,KAAa,EAAE,IAAc,EAAE,GAAW;QAE3D,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;YACtB,OAAM;QACR,CAAC;QAGD,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,OAAM;QACR,CAAC;QAGD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;YAGzB,IAAI,GAAG,GAAG,GAAG,GAAG,MAAM;gBAAE,MAAK;YAG7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAGd,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;YAG7B,IAAI,CAAC,GAAG,EAAE,CAAA;QACZ,CAAC;IACH,CAAC;IAED,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;IACnB,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/functions/algorithm/editDistance.d.ts

@@ -0,0 +1,2 @@
+import type { EditDistanceResult } from '../../../types/algorithm';
+export declare function editDistance(source: string, target: string, includeDpTable?: boolean): EditDistanceResult;

package/dist/functions/algorithm/editDistance.js

@@ -0,0 +1,96 @@
+export function editDistance(source, target, includeDpTable = false) {
+    const m = source.length;
+    const n = target.length;
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    for (let i = 0; i <= m; i++) {
+        dp[i][0] = i;
+    }
+    for (let j = 0; j <= n; j++) {
+        dp[0][j] = j;
+    }
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            if (source[i - 1] === target[j - 1]) {
+                dp[i][j] = dp[i - 1][j - 1];
+            }
+            else {
+                dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1);
+            }
+        }
+    }
+    const operations = [];
+    let i = m;
+    let j = n;
+    while (i > 0 || j > 0) {
+        if (i === 0) {
+            operations.unshift({
+                type: 'insert',
+                sourceIndex: i,
+                targetIndex: j - 1,
+                targetChar: target[j - 1]
+            });
+            j--;
+        }
+        else if (j === 0) {
+            operations.unshift({
+                type: 'delete',
+                sourceIndex: i - 1,
+                targetIndex: j,
+                sourceChar: source[i - 1]
+            });
+            i--;
+        }
+        else if (source[i - 1] === target[j - 1]) {
+            operations.unshift({
+                type: 'keep',
+                sourceIndex: i - 1,
+                targetIndex: j - 1,
+                sourceChar: source[i - 1],
+                targetChar: target[j - 1]
+            });
+            i--;
+            j--;
+        }
+        else {
+            const deleteCost = dp[i - 1][j];
+            const insertCost = dp[i][j - 1];
+            const replaceCost = dp[i - 1][j - 1];
+            const minCost = Math.min(deleteCost, insertCost, replaceCost);
+            if (minCost === replaceCost) {
+                operations.unshift({
+                    type: 'replace',
+                    sourceIndex: i - 1,
+                    targetIndex: j - 1,
+                    sourceChar: source[i - 1],
+                    targetChar: target[j - 1]
+                });
+                i--;
+                j--;
+            }
+            else if (minCost === deleteCost) {
+                operations.unshift({
+                    type: 'delete',
+                    sourceIndex: i - 1,
+                    targetIndex: j,
+                    sourceChar: source[i - 1]
+                });
+                i--;
+            }
+            else {
+                operations.unshift({
+                    type: 'insert',
+                    sourceIndex: i,
+                    targetIndex: j - 1,
+                    targetChar: target[j - 1]
+                });
+                j--;
+            }
+        }
+    }
+    return {
+        distance: dp[m][n],
+        operations,
+        ...(includeDpTable && { dpTable: dp })
+    };
+}
+//# sourceMappingURL=editDistance.js.map

package/dist/functions/algorithm/editDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"editDistance.js","sourceRoot":"","sources":["../../../src/functions/algorithm/editDistance.ts"],"names":[],"mappings":"AA2BA,MAAM,UAAU,YAAY,CAC1B,MAAc,EACd,MAAc,EACd,cAAc,GAAG,KAAK;IAEtB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAA;IACvB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAA;IAIvB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAGhF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACd,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACd,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAEpC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC7B,CAAC;iBAAM,CAAC;gBAEN,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACjB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CACrB,CAAA;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,UAAU,GAAoB,EAAE,CAAA;IACtC,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAEZ,UAAU,CAAC,OAAO,CAAC;gBACjB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,CAAC,GAAG,CAAC;gBAClB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;aAC1B,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAEnB,UAAU,CAAC,OAAO,CAAC;gBACjB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,CAAC,GAAG,CAAC;gBAClB,WAAW,EAAE,CAAC;gBACd,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;aAC1B,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAE3C,UAAU,CAAC,OAAO,CAAC;gBACjB,IAAI,EAAE,MAAM;gBACZ,WAAW,EAAE,CAAC,GAAG,CAAC;gBAClB,WAAW,EAAE,CAAC,GAAG,CAAC;gBAClB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;aAC1B,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,CAAC;YAEN,MAAM,UAAU,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/B,MAAM,UAAU,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC/B,MAAM,WAAW,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC,CAAA;YAE7D,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;gBAC5B,UAAU,CAAC,OAAO,CAAC;oBACjB,IAAI,EAAE,SAAS;oBACf,WAAW,EAAE,CAAC,GAAG,CAAC;oBAClB,WAAW,EAAE,CAAC,GAAG,CAAC;oBAClB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oBACzB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iBAC1B,CAAC,CAAA;gBACF,CAAC,EAAE,CAAA;gBACH,CAAC,EAAE,CAAA;YACL,CAAC;iBAAM,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;gBAClC,UAAU,CAAC,OAAO,CAAC;oBACjB,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,CAAC,GAAG,CAAC;oBAClB,WAAW,EAAE,CAAC;oBACd,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iBAC1B,CAAC,CAAA;gBACF,CAAC,EAAE,CAAA;YACL,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,OAAO,CAAC;oBACjB,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,CAAC;oBACd,WAAW,EAAE,CAAC,GAAG,CAAC;oBAClB,UAAU,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iBAC1B,CAAC,CAAA;gBACF,CAAC,EAAE,CAAA;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,UAAU;QACV,GAAG,CAAC,cAAc,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;KACvC,CAAA;AACH,CAAC"}

package/dist/functions/algorithm/generateParenthesis.d.ts

@@ -0,0 +1 @@
+export declare function generateParenthesis(n: number): string[];

package/dist/functions/algorithm/generateParenthesis.js

@@ -0,0 +1,18 @@
+export function generateParenthesis(n) {
+    const result = [];
+    function backtrack(path, left, right) {
+        if (path.length === 2 * n) {
+            result.push(path);
+            return;
+        }
+        if (left < n) {
+            backtrack(path + '(', left + 1, right);
+        }
+        if (right < left) {
+            backtrack(path + ')', left, right + 1);
+        }
+    }
+    backtrack('', 0, 0);
+    return result;
+}
+//# sourceMappingURL=generateParenthesis.js.map

package/dist/functions/algorithm/generateParenthesis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generateParenthesis.js","sourceRoot":"","sources":["../../../src/functions/algorithm/generateParenthesis.ts"],"names":[],"mappings":"AAiBA,MAAM,UAAU,mBAAmB,CAAC,CAAS;IAC3C,MAAM,MAAM,GAAa,EAAE,CAAA;IAE3B,SAAS,SAAS,CAAC,IAAY,EAAE,IAAY,EAAE,KAAa;QAE1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACjB,OAAM;QACR,CAAC;QAGD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;QACxC,CAAC;QAGD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;YACjB,SAAS,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QACxC,CAAC;IACH,CAAC;IAED,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACnB,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/functions/algorithm/kmp.d.ts

@@ -0,0 +1,2 @@
+export declare function kmpSearch(text: string, pattern: string): number[];
+export declare function strStr(haystack: string, needle: string): number;

package/dist/functions/algorithm/kmp.js

@@ -0,0 +1,58 @@
+export function kmpSearch(text, pattern) {
+    if (pattern.length === 0)
+        return [];
+    const next = buildNext(pattern);
+    const result = [];
+    let i = 0;
+    let j = 0;
+    while (i < text.length) {
+        if (text[i] === pattern[j]) {
+            i++;
+            j++;
+            if (j === pattern.length) {
+                result.push(i - j);
+                j = next[j - 1];
+            }
+        }
+        else if (j > 0) {
+            j = next[j - 1];
+        }
+        else {
+            i++;
+        }
+    }
+    return result;
+}
+function buildNext(pattern) {
+    const next = Array(pattern.length).fill(0);
+    let j = 0;
+    for (let i = 1; i < pattern.length; i++) {
+        while (j > 0 && pattern[i] !== pattern[j]) {
+            j = next[j - 1];
+        }
+        if (pattern[i] === pattern[j]) {
+            j++;
+        }
+        next[i] = j;
+    }
+    return next;
+}
+export function strStr(haystack, needle) {
+    if (needle.length === 0)
+        return 0;
+    const next = buildNext(needle);
+    let j = 0;
+    for (let i = 0; i < haystack.length; i++) {
+        while (j > 0 && haystack[i] !== needle[j]) {
+            j = next[j - 1];
+        }
+        if (haystack[i] === needle[j]) {
+            j++;
+        }
+        if (j === needle.length) {
+            return i - j + 1;
+        }
+    }
+    return -1;
+}
+//# sourceMappingURL=kmp.js.map

package/dist/functions/algorithm/kmp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kmp.js","sourceRoot":"","sources":["../../../src/functions/algorithm/kmp.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,OAAe;IACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEnC,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAA;IAE3B,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3B,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;YAGH,IAAI,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAClB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACjB,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAEjB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjB,CAAC;aAAM,CAAC;YAEN,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAKD,SAAS,SAAS,CAAC,OAAe;IAChC,MAAM,IAAI,GAAa,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACpD,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjB,CAAC;QAED,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9B,CAAC,EAAE,CAAA;QACL,CAAC;QAED,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACb,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAKD,MAAM,UAAU,MAAM,CAAC,QAAgB,EAAE,MAAc;IACrD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEjC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;IAC9B,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,OAAO,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjB,CAAC;QAED,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9B,CAAC,EAAE,CAAA;QACL,CAAC;QAED,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAA;AACX,CAAC"}

package/dist/functions/algorithm/knapsack01.d.ts

@@ -0,0 +1,2 @@
+import type { KnapsackItem, KnapsackResult } from '../../../types/algorithm';
+export declare function knapsack01(items: KnapsackItem[], capacity: number, includeDpTable?: boolean): KnapsackResult;

package/dist/functions/algorithm/knapsack01.js

@@ -0,0 +1,34 @@
+export function knapsack01(items, capacity, includeDpTable = false) {
+    const n = items.length;
+    if (n === 0 || capacity <= 0) {
+        return {
+            maxValue: 0,
+            selectedItems: []
+        };
+    }
+    const dp = Array.from({ length: n + 1 }, () => Array(capacity + 1).fill(0));
+    for (let i = 1; i <= n; i++) {
+        const item = items[i - 1];
+        for (let w = 0; w <= capacity; w++) {
+            dp[i][w] = dp[i - 1][w];
+            if (w >= item.weight) {
+                const valueWithItem = dp[i - 1][w - item.weight] + item.value;
+                dp[i][w] = Math.max(dp[i][w], valueWithItem);
+            }
+        }
+    }
+    const selectedItems = [];
+    let w = capacity;
+    for (let i = n; i > 0; i--) {
+        if (dp[i][w] !== dp[i - 1][w]) {
+            selectedItems.unshift(i - 1);
+            w -= items[i - 1].weight;
+        }
+    }
+    return {
+        maxValue: dp[n][capacity],
+        selectedItems,
+        ...(includeDpTable && { dpTable: dp })
+    };
+}
+//# sourceMappingURL=knapsack01.js.map

package/dist/functions/algorithm/knapsack01.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knapsack01.js","sourceRoot":"","sources":["../../../src/functions/algorithm/knapsack01.ts"],"names":[],"mappings":"AA6BA,MAAM,UAAU,UAAU,CACxB,KAAqB,EACrB,QAAgB,EAChB,cAAc,GAAG,KAAK;IAEtB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;IAEtB,IAAI,CAAC,KAAK,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,aAAa,EAAE,EAAE;SAClB,CAAA;IACH,CAAC;IAID,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAGvF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAEnC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAGvB,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,aAAa,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;gBAC7D,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAA;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,aAAa,GAAa,EAAE,CAAA;IAClC,IAAI,CAAC,GAAG,QAAQ,CAAA;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAE3B,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9B,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC5B,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAA;QAC1B,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACzB,aAAa;QACb,GAAG,CAAC,cAAc,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;KACvC,CAAA;AACH,CAAC"}

package/dist/functions/algorithm/lengthOfLongestSubstring.d.ts

@@ -0,0 +1,2 @@
+export declare function lengthOfLongestSubstring(s: string): number;
+export declare function longestSubstringWithoutRepeating(s: string): string;

package/dist/functions/algorithm/lengthOfLongestSubstring.js

@@ -0,0 +1,33 @@
+export function lengthOfLongestSubstring(s) {
+    const charMap = new Map();
+    let left = 0;
+    let maxLen = 0;
+    for (let right = 0; right < s.length; right++) {
+        const char = s[right];
+        if (charMap.has(char)) {
+            left = Math.max(left, charMap.get(char) + 1);
+        }
+        charMap.set(char, right);
+        maxLen = Math.max(maxLen, right - left + 1);
+    }
+    return maxLen;
+}
+export function longestSubstringWithoutRepeating(s) {
+    const charMap = new Map();
+    let left = 0;
+    let maxLen = 0;
+    let maxStart = 0;
+    for (let right = 0; right < s.length; right++) {
+        const char = s[right];
+        if (charMap.has(char)) {
+            left = Math.max(left, charMap.get(char) + 1);
+        }
+        charMap.set(char, right);
+        if (right - left + 1 > maxLen) {
+            maxLen = right - left + 1;
+            maxStart = left;
+        }
+    }
+    return s.substring(maxStart, maxStart + maxLen);
+}
+//# sourceMappingURL=lengthOfLongestSubstring.js.map

package/dist/functions/algorithm/lengthOfLongestSubstring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lengthOfLongestSubstring.js","sourceRoot":"","sources":["../../../src/functions/algorithm/lengthOfLongestSubstring.ts"],"names":[],"mappings":"AAiBA,MAAM,UAAU,wBAAwB,CAAC,CAAS;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IACzC,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QAGrB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,CAAC,CAAC,CAAA;QAC/C,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACxB,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAA;IAC7C,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAKD,MAAM,UAAU,gCAAgC,CAAC,CAAS;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IACzC,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QAErB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,CAAC,CAAC,CAAA;QAC/C,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAExB,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;YAC9B,MAAM,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,CAAA;YACzB,QAAQ,GAAG,IAAI,CAAA;QACjB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAAC,CAAA;AACjD,CAAC"}

package/dist/functions/algorithm/longestCommonSubsequence.d.ts

@@ -0,0 +1,2 @@
+import type { LCSResult } from '../../../types/algorithm';
+export declare function longestCommonSubsequence(str1: string, str2: string, includeDpTable?: boolean): LCSResult;

package/dist/functions/algorithm/longestCommonSubsequence.js

@@ -0,0 +1,37 @@
+export function longestCommonSubsequence(str1, str2, includeDpTable = false) {
+    const m = str1.length;
+    const n = str2.length;
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            if (str1[i - 1] === str2[j - 1]) {
+                dp[i][j] = dp[i - 1][j - 1] + 1;
+            }
+            else {
+                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+            }
+        }
+    }
+    let i = m;
+    let j = n;
+    const lcs = [];
+    while (i > 0 && j > 0) {
+        if (str1[i - 1] === str2[j - 1]) {
+            lcs.unshift(str1[i - 1]);
+            i--;
+            j--;
+        }
+        else if (dp[i - 1][j] > dp[i][j - 1]) {
+            i--;
+        }
+        else {
+            j--;
+        }
+    }
+    return {
+        length: dp[m][n],
+        sequence: lcs.join(''),
+        ...(includeDpTable && { dpTable: dp })
+    };
+}
+//# sourceMappingURL=longestCommonSubsequence.js.map

package/dist/functions/algorithm/longestCommonSubsequence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"longestCommonSubsequence.js","sourceRoot":"","sources":["../../../src/functions/algorithm/longestCommonSubsequence.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,IAAY,EACZ,cAAc,GAAG,KAAK;IAEtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IAGrB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAGhF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAChC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YACjC,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAGD,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,MAAM,GAAG,GAAa,EAAE,CAAA;IAExB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACxB,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACvC,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,CAAC;YACN,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,GAAG,CAAC,cAAc,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;KACvC,CAAA;AACH,CAAC"}

package/dist/functions/algorithm/longestIncreasingSubsequence.d.ts

@@ -0,0 +1,2 @@
+import type { LISResult } from '../../../types/algorithm';
+export declare function longestIncreasingSubsequence(nums: number[], includeDp?: boolean): LISResult;

package/dist/functions/algorithm/longestIncreasingSubsequence.js

@@ -0,0 +1,49 @@
+export function longestIncreasingSubsequence(nums, includeDp = false) {
+    const n = nums.length;
+    if (n === 0) {
+        return {
+            length: 0,
+            sequence: []
+        };
+    }
+    const tails = [];
+    const parent = Array(n).fill(-1);
+    const tailIndices = [];
+    for (let i = 0; i < n; i++) {
+        const num = nums[i];
+        let left = 0;
+        let right = tails.length;
+        while (left < right) {
+            const mid = Math.floor((left + right) / 2);
+            if (tails[mid] < num) {
+                left = mid + 1;
+            }
+            else {
+                right = mid;
+            }
+        }
+        if (left === tails.length) {
+            tails.push(num);
+            tailIndices.push(i);
+        }
+        else {
+            tails[left] = num;
+            tailIndices[left] = i;
+        }
+        if (left > 0) {
+            parent[i] = tailIndices[left - 1];
+        }
+    }
+    const sequence = [];
+    let currentIndex = tailIndices[tails.length - 1];
+    while (currentIndex !== -1) {
+        sequence.unshift(nums[currentIndex]);
+        currentIndex = parent[currentIndex];
+    }
+    return {
+        length: tails.length,
+        sequence,
+        ...(includeDp && { dp: tails })
+    };
+}
+//# sourceMappingURL=longestIncreasingSubsequence.js.map

package/dist/functions/algorithm/longestIncreasingSubsequence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"longestIncreasingSubsequence.js","sourceRoot":"","sources":["../../../src/functions/algorithm/longestIncreasingSubsequence.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,4BAA4B,CAC1C,IAAc,EACd,SAAS,GAAG,KAAK;IAEjB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IAErB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO;YACL,MAAM,EAAE,CAAC;YACT,QAAQ,EAAE,EAAE;SACb,CAAA;IACH,CAAC;IAGD,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,MAAM,MAAM,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAE1C,MAAM,WAAW,GAAa,EAAE,CAAA;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAGnB,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAA;QAExB,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;gBACrB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,GAAG,CAAA;YACb,CAAC;QACH,CAAC;QAGD,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACf,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAA;YACjB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACvB,CAAC;QAGD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QACnC,CAAC;IACH,CAAC;IAGD,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,IAAI,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAEhD,OAAO,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3B,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAA;QACpC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,CAAA;IACrC,CAAC;IAED,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ;QACR,GAAG,CAAC,SAAS,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;KAChC,CAAA;AACH,CAAC"}

package/dist/functions/algorithm/maxArea.d.ts

@@ -0,0 +1 @@
+export declare function maxArea(height: number[]): number;

package/dist/functions/algorithm/maxArea.js

@@ -0,0 +1,19 @@
+export function maxArea(height) {
+    let left = 0;
+    let right = height.length - 1;
+    let max = 0;
+    while (left < right) {
+        const width = right - left;
+        const h = Math.min(height[left], height[right]);
+        const area = width * h;
+        max = Math.max(max, area);
+        if (height[left] < height[right]) {
+            left++;
+        }
+        else {
+            right--;
+        }
+    }
+    return max;
+}
+//# sourceMappingURL=maxArea.js.map

package/dist/functions/algorithm/maxArea.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maxArea.js","sourceRoot":"","sources":["../../../src/functions/algorithm/maxArea.ts"],"names":[],"mappings":"AAiBA,MAAM,UAAU,OAAO,CAAC,MAAgB;IACtC,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC7B,IAAI,GAAG,GAAG,CAAC,CAAA;IAEX,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;QAEpB,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAA;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;QAC/C,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAA;QACtB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAGzB,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,IAAI,EAAE,CAAA;QACR,CAAC;aAAM,CAAC;YACN,KAAK,EAAE,CAAA;QACT,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/dist/functions/algorithm/maxProfit.d.ts

@@ -0,0 +1,2 @@
+export declare function maxProfit(prices: number[]): number;
+export declare function maxProfitOnce(prices: number[]): number;