feat: add solutions to lc problem: No.2501 (#3683)

Author: rain84

solution/2500-2599/2501.Longest Square Streak in an Array/README.md

@@ -291,4 +291,94 @@ func longestSquareStreak(nums []int) (ans int) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法三：计数
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function longestSquareStreak(nums: number[]): number {
+    const cnt: Record<number, number> = {};
+    const squares = new Set<number>();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}
+```
+
+#### JavaScript
+
+```js
+function longestSquareStreak(nums) {
+    const cnt = {};
+    const squares = new Set();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/2500-2599/2501.Longest Square Streak in an Array/README_EN.md

@@ -291,4 +291,94 @@ func longestSquareStreak(nums []int) (ans int) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Counting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function longestSquareStreak(nums: number[]): number {
+    const cnt: Record<number, number> = {};
+    const squares = new Set<number>();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}
+```
+
+#### JavaScript
+
+```js
+function longestSquareStreak(nums) {
+    const cnt = {};
+    const squares = new Set();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/2500-2599/2501.Longest Square Streak in an Array/Solution3.js

@@ -0,0 +1,35 @@
+function longestSquareStreak(nums) {
+    const cnt = {};
+    const squares = new Set();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}

solution/2500-2599/2501.Longest Square Streak in an Array/Solution3.ts

@@ -0,0 +1,35 @@
+function longestSquareStreak(nums: number[]): number {
+    const cnt: Record<number, number> = {};
+    const squares = new Set<number>();
+
+    for (const x of new Set(nums)) {
+        cnt[x] = (cnt[x] ?? -1) + 1;
+        cnt[x ** 2] = (cnt[x ** 2] ?? -1) + 1;
+    }
+
+    for (const key in cnt) {
+        const x = +key;
+        if (cnt[x] || cnt[x ** 2]) {
+            squares.add(x);
+        }
+    }
+
+    if (squares.size <= 1) return -1;
+
+    const iterator = squares[Symbol.iterator]();
+    let [max, c, x] = [0, 0, iterator.next().value];
+
+    while (x !== undefined) {
+        if (squares.has(x)) {
+            squares.delete(x);
+            x **= 2;
+            c++;
+        } else {
+            max = Math.max(max, c);
+            x = iterator.next().value;
+            c = 0;
+        }
+    }
+
+    return max;
+}