https://leetcode.cn/problems/number-of-subarrays-with-gcd-equal-to-k/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/number-of-subarrays-with-gcd-equal-to-k/
+
 https://leetcode.cn/problems/smallest-subarrays-with-maximum-bitwise-or/
 
 https://leetcode.cn/problems/determine-if-two-events-have-conflict/

fraction-addition-and-subtraction/index.ts

@@ -1,4 +1,4 @@
-import { greatestCommonDivisor } from "../max-points-on-a-line/greatest_common_divisor.ts";
+import { gcd } from "../max-points-on-a-line/greatest_common_divisor.ts";
 import { deduplication } from "./deduplication.ts";
 import { Fraction } from "./Fraction.ts";
 import { parseFraction } from "./parseFraction.ts";
@@ -18,18 +18,16 @@ export function fractionAdd(fractions: Fraction[]): Fraction {
 }
 export function simplifyFraction(fraction: Fraction) {
     const { molecular, denominator } = fraction;
-    const gcd = greatestCommonDivisor(molecular, denominator);
+    const g = gcd(molecular, denominator);
     return new Fraction({
         sign: fraction.sign,
-        denominator: fraction.denominator / gcd,
-        molecular: fraction.molecular / gcd,
+        denominator: fraction.denominator / g,
+        molecular: fraction.molecular / g,
     });
 }
 function fractionAddition(expression: string): string {
     const fractions = parseFraction(expression);
 
-    return FractionToString(
-        simplifyFraction(fractionAdd(fractions)),
-    );
+    return FractionToString(simplifyFraction(fractionAdd(fractions)));
 }
 export default fractionAddition;

max-points-on-a-line/greatest_common_divisor.ts

@@ -1,3 +1,3 @@
-export function greatestCommonDivisor(a: number, b: number): number {
-    return b != 0 ? greatestCommonDivisor(b, a % b) : a;
+export function gcd(a: number, b: number): number {
+    return b != 0 ? gcd(b, a % b) : a;
 }

mod.ts

@@ -33,7 +33,7 @@ import { PrefixTreeSearchEach } from "./longest-word-in-dictionary/PrefixTreeSea
 import { PrefixTreeSearchPrefixEach } from "./longest-word-in-dictionary/PrefixTreeSearchPrefixEach.ts";
 import { PrefixTreeWithSum } from "./map-sum-pairs/PrefixTreeWithSum.ts";
 import { calculateStraightLineEquation } from "./max-points-on-a-line/calculateStraightLineEquation.ts";
-import { greatestCommonDivisor } from "./max-points-on-a-line/greatest_common_divisor.ts";
+import { gcd } from "./max-points-on-a-line/greatest_common_divisor.ts";
 import { uniqueStraightLineEquation } from "./max-points-on-a-line/uniqueStraightLineEquation.ts";
 import { bigintMax } from "./maximum-width-of-binary-tree/bigint_max.ts";
 import { bigintMin } from "./maximum-width-of-binary-tree/bigint_min.ts";
@@ -73,6 +73,7 @@ import { multiply_Mod } from "./super-pow/multiply_Mod.ts";
 import { pow_bigint_mod } from "./super-pow/pow_bigint_mod.ts";
 import { superPow_mod } from "./super-pow/superPow_mod.ts";
 import { traversal_bst_range } from "./tweet-counts-per-frequency/traversal_bst_range.ts";
+import { gcd as gcdBigint } from "./ugly-number-iii/index.ts";
 import { float64equals } from "./utils/float64equals.ts";
 import { PrefixTreeClear } from "./utils/PrefixTreeClear.ts";
 import { PrefixTreeForEach } from "./utils/PrefixTreeForEach.ts";
@@ -99,10 +100,11 @@ export { climbing_stairs_bigint } from "./climbing-stairs/climbing_stairs_bigint
 export { fibonacci_bigint } from "./fibonacci-number/fibonacci_bigint.ts";
 export { PrefixTreeWithSum };
 export { PrefixTreeClear };
-export { greatestCommonDivisor };
+export { gcd };
 export { calculateStraightLineEquation, uniqueStraightLineEquation };
 export { parseComplex };
 export {
+    gcdBigint,
     left_rotate,
     TrieNode,
     TrieNodeCountWordsEqualTo,

number-of-subarrays-with-gcd-equal-to-k/index.ts

@@ -0,0 +1,35 @@
+export default function subarrayGCD(nums: number[], k: number): number {
+    const n = nums.length;
+    let l = 0,
+        r = 0,
+        f = nums[r],
+        c = 0;
+    while (r < n) {
+        const e = gcd(f, nums[r]);
+        if (e % k != 0) {
+            r++;
+            if (r == n) break;
+            l = r;
+            f = nums[r];
+            continue;
+        } else if (e == k) {
+            let p = r,
+                d = nums[r];
+            while (p >= l) {
+                const g = gcd(nums[p], d);
+                if (g == k) {
+                    c += p - l + 1;
+                    break;
+                }
+                d = g;
+                p--;
+            }
+        }
+        f = e;
+        r++;
+    }
+    return c;
+}
+export function gcd(a: number, b: number): number {
+    return b != 0 ? gcd(b, a % b) : a;
+}

tree-of-coprimes/export.go

@@ -3,7 +3,3 @@ package index
 func GetCoprimes(nums []int, edges [][]int) []int {
 	return getCoprimes(nums, edges)
 }
-func GreatestCommonDivisor(a int, b int) int {
-
-	return greatestCommonDivisor(a, b)
-}

tree-of-coprimes/index.go

@@ -19,7 +19,7 @@ func getCoprimes(nums []int, edges [][]int) []int {
 		}
 		for i := 0; i < 51; i++ {
 			for j := i; j < 51; j++ {
-				prime[j][i] = greatestCommonDivisor(i, j) == 1
+				prime[j][i] = Gcd(i, j) == 1
 				prime[i][j] = prime[j][i]
 			}
 		}
@@ -66,9 +66,9 @@ func getCoprimes(nums []int, edges [][]int) []int {
 	return results
 }
 
-func greatestCommonDivisor(a int, b int) int {
+func Gcd(a int, b int) int {
 	for b != 0 {
-		return greatestCommonDivisor(b, a%b)
+		return Gcd(b, a%b)
 	}
 	return a
 }

tree-of-coprimes/index.ts

@@ -1,4 +1,4 @@
-import { greatestCommonDivisor } from "../max-points-on-a-line/greatest_common_divisor.ts";
+import { gcd } from "../max-points-on-a-line/greatest_common_divisor.ts";
 
 export default getCoprimes;
 function getCoprimes(nums: number[], edges: number[][]): number[] {
@@ -17,7 +17,7 @@ function getCoprimes(nums: number[], edges: number[][]): number[] {
 
         for (const i of Array(51).keys()) {
             for (let j = i; j < 51; j++) {
-                prime[i][j] = prime[j][i] = greatestCommonDivisor(i, j) === 1;
+                prime[i][j] = prime[j][i] = gcd(i, j) === 1;
             }
         }
     }