https://leetcode.cn/problems/combination-sum-iii/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/combination-sum-iii/
+
 https://leetcode.cn/problems/range-product-queries-of-powers/
 
 https://leetcode.cn/problems/number-of-valid-clock-times/

combination-sum-iii/index.ts

@@ -0,0 +1,35 @@
+function combinationSum3(k: number, n: number): number[][] {
+    if (n < k || n > 45) {
+        return [];
+    }
+    const nums = Array(Math.min(9, n - k + 1))
+        .fill(0)
+        .map((_, i) => i + 1);
+    const visited = new Set<number>();
+    const ans: number[][] = [];
+    function dfs(path: number[], sum: number): void {
+        // console.log(path, sum);
+        if (sum > n || path.length > k) return;
+
+        if (
+            path.length >= 2 && path[path.length - 1] <= path[path.length - 2]
+        ) {
+            return;
+        }
+        if (path.length === k && sum === n) {
+            ans.push([...path]);
+            return;
+        }
+        for (const v of nums) {
+            if (visited.has(v)) continue;
+            path.push(v);
+            visited.add(v);
+            dfs(path, sum + v);
+            path.pop();
+            visited.delete(v);
+        }
+    }
+    dfs([], 0);
+    return ans;
+}
+export default combinationSum3;

fancy-sequence/Fancy.ts

@@ -29,10 +29,10 @@ export default function Fancy(): Fancy {
         r_mult = (r_mult * multiplicativeInverse(m, MOD)) % MOD;
     }
 
-    const getIndex = function (idx: number): number {
+    function getIndex(idx: number): number {
         if (idx >= values.length) return -1;
         return Number((mult * BigInt(values[idx]) + add) % MOD);
-    };
+    }
     return { getIndex, multAll, addAll, append };
 }
 export function multiplicativeInverse(x: number, mod: bigint): bigint {