https://leetcode.cn/problems/number-of-different-subsequences-gcds/

Author: masx200

README.md

@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/number-of-different-subsequences-gcds/
+
 https://leetcode-cn.com/problems/rearrange-characters-to-make-target-string/
 
 https://leetcode-cn.com/problems/assign-cookies/

deno.lock

@@ -11,7 +11,8 @@ export { default as countBy } from "https://cdn.skypack.dev/lodash@4.17.21/count
 export { default as zip } from "https://cdn.skypack.dev/lodash@4.17.21/zip?dts";
 export { default as isEqual } from "https://cdn.skypack.dev/lodash@4.17.21/isEqual?dts";
 export { default as uniqBy } from "https://cdn.skypack.dev/lodash@4.17.21/uniqBy?dts";
-
+export { default as max } from "https://cdn.skypack.dev/lodash@4.17.21/max?dts";
+export { default as sum } from "https://cdn.skypack.dev/lodash@4.17.21/sum?dts";
 export { default as intersection } from "https://cdn.skypack.dev/lodash@4.17.21/intersection?dts";
 import { BinaryHeap } from "https://deno.land/std@0.171.0/collections/binary_heap.ts";
 export { BinaryHeap };
@@ -26,7 +27,7 @@ export {
     BinarySearchTreeNode,
 } from "npm:@datastructures-js/binary-search-tree@5.2.0";
 export { default as groupBy } from "https://cdn.skypack.dev/lodash@4.17.21/groupBy?dts";
-export { default as sum } from "https://cdn.skypack.dev/lodash@4.17.21/sum?dts";
+
 export {
     runScript,
     TreeNode,

deps.ts

@@ -0,0 +1,36 @@
+import { max } from "../deps.ts";
+
+function countDifferentSubsequenceGCDs(nums: number[]): number {
+    const maxVal = max(nums) as number;
+    const occured = new Array<boolean>(maxVal + 1).fill(false);
+    for (const num of nums) {
+        occured[num] = true;
+    }
+    let ans = 0;
+    for (let i = 1; i <= maxVal; i++) {
+        let subGcd = 0;
+        for (let j = i; j <= maxVal; j += i) {
+            if (occured[j]) {
+                if (subGcd === 0) {
+                    subGcd = j;
+                } else {
+                    subGcd = gcd(subGcd, j);
+                }
+                if (subGcd === i) {
+                    ans++;
+                    break;
+                }
+            }
+        }
+    }
+    return ans;
+}
+export function gcd(num1: number, num2: number) {
+    while (num2 !== 0) {
+        const temp = num1;
+        num1 = num2;
+        num2 = temp % num2;
+    }
+    return num1;
+}
+export default countDifferentSubsequenceGCDs;