feat: add solutions to lc problem: No.1510

No.1510.Stone Game IV

Author: yanglbme

solution/1500-1599/1510.Stone Game IV/README.md

@@ -110,12 +110,12 @@ $$
 class Solution:
     def winnerSquareGame(self, n: int) -> bool:
         @cache
-        def dfs(i):
-            if i <= 0:
+        def dfs(i: int) -> bool:
+            if i == 0:
                 return False
             j = 1
-            while (k := (i - j * j)) >= 0:
-                if not dfs(k):
+            while j * j <= i:
+                if not dfs(i - j * j):
                     return True
                 j += 1
             return False
@@ -273,6 +273,46 @@ func winnerSquareGame(n int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function winnerSquareGame(n: number): boolean {
+    const f: number[] = new Array(n + 1).fill(0);
+    const dfs = (i: number): boolean => {
+        if (i <= 0) {
+            return false;
+        }
+        if (f[i] !== 0) {
+            return f[i] === 1;
+        }
+        for (let j = 1; j * j <= i; ++j) {
+            if (!dfs(i - j * j)) {
+                f[i] = 1;
+                return true;
+            }
+        }
+        f[i] = -1;
+        return false;
+    };
+    return dfs(n);
+}
+```
+
+```ts
+function winnerSquareGame(n: number): boolean {
+    const f: boolean[] = new Array(n + 1).fill(false);
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j * j <= i; ++j) {
+            if (!f[i - j * j]) {
+                f[i] = true;
+                break;
+            }
+        }
+    }
+    return f[n];
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1510.Stone Game IV/README_EN.md

@@ -53,12 +53,12 @@
 class Solution:
     def winnerSquareGame(self, n: int) -> bool:
         @cache
-        def dfs(i):
-            if i <= 0:
+        def dfs(i: int) -> bool:
+            if i == 0:
                 return False
             j = 1
-            while (k := (i - j * j)) >= 0:
-                if not dfs(k):
+            while j * j <= i:
+                if not dfs(i - j * j):
                     return True
                 j += 1
             return False
@@ -214,6 +214,46 @@ func winnerSquareGame(n int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function winnerSquareGame(n: number): boolean {
+    const f: number[] = new Array(n + 1).fill(0);
+    const dfs = (i: number): boolean => {
+        if (i <= 0) {
+            return false;
+        }
+        if (f[i] !== 0) {
+            return f[i] === 1;
+        }
+        for (let j = 1; j * j <= i; ++j) {
+            if (!dfs(i - j * j)) {
+                f[i] = 1;
+                return true;
+            }
+        }
+        f[i] = -1;
+        return false;
+    };
+    return dfs(n);
+}
+```
+
+```ts
+function winnerSquareGame(n: number): boolean {
+    const f: boolean[] = new Array(n + 1).fill(false);
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j * j <= i; ++j) {
+            if (!f[i - j * j]) {
+                f[i] = true;
+                break;
+            }
+        }
+    }
+    return f[n];
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1510.Stone Game IV/Solution.py

@@ -1,12 +1,12 @@
 class Solution:
     def winnerSquareGame(self, n: int) -> bool:
         @cache
-        def dfs(i):
-            if i <= 0:
+        def dfs(i: int) -> bool:
+            if i == 0:
                 return False
             j = 1
-            while (k := (i - j * j)) >= 0:
-                if not dfs(k):
+            while j * j <= i:
+                if not dfs(i - j * j):
                     return True
                 j += 1
             return False

solution/1500-1599/1510.Stone Game IV/Solution.ts

@@ -0,0 +1,12 @@
+function winnerSquareGame(n: number): boolean {
+    const f: boolean[] = new Array(n + 1).fill(false);
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j * j <= i; ++j) {
+            if (!f[i - j * j]) {
+                f[i] = true;
+                break;
+            }
+        }
+    }
+    return f[n];
+}