feat: add typescript solution to lc problem: No.2447

No.2447.Number of Subarrays With GCD Equal to K

Author: zhaocchen

solution/2400-2499/2447.Number of Subarrays With GCD Equal to K/README.md

@@ -145,7 +145,24 @@ func gcd(a, b int) int {
 ### **TypeScript**
 
 ```ts
+function subarrayGCD(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let x = nums[i];
+        for (let j = i; j < n; j++) {
+            x = gcd(nums[j], x);
+            if (x == k) ans += 1;
+        }
+    }
+    return ans;
+};
 
+function gcd(a: number, b: number): number {
+    if (a > b) [a, b] = [b, a];
+    if (a == 0) return b;
+    return gcd(b % a, a);
+}
 ```
 
 ### **...**

solution/2400-2499/2447.Number of Subarrays With GCD Equal to K/README_EN.md

@@ -131,7 +131,24 @@ func gcd(a, b int) int {
 ### **TypeScript**
 
 ```ts
+function subarrayGCD(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let x = nums[i];
+        for (let j = i; j < n; j++) {
+            x = gcd(nums[j], x);
+            if (x == k) ans += 1;
+        }
+    }
+    return ans;
+};
 
+function gcd(a: number, b: number): number {
+    if (a > b) [a, b] = [b, a];
+    if (a == 0) return b;
+    return gcd(b % a, a);
+}
 ```
 
 ### **...**

solution/2400-2499/2447.Number of Subarrays With GCD Equal to K/Solution.ts

@@ -0,0 +1,18 @@
+function subarrayGCD(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let x = nums[i];
+        for (let j = i; j < n; j++) {
+            x = gcd(nums[j], x);
+            if (x == k) ans += 1;
+        }
+    }
+    return ans;
+};
+
+function gcd(a: number, b: number): number {
+    if (a > b) [a, b] = [b, a];
+    if (a == 0) return b;
+    return gcd(b % a, a);
+}