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

No.0688.Knight Probability in Chessboard

Author: zhaocchen

solution/0600-0699/0688.Knight Probability in Chessboard/README.md

@@ -66,6 +66,33 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function knightProbability(n: number, k: number, row: number, column: number): number {
+    let dp = Array.from({ length: k + 1 }, v => Array.from({ length: n }, w => new Array(n).fill(0)));
+    const directions = [[-2, -1], [-2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2], [2, -1], [2, 1]];
+    for (let depth = 0; depth <= k; depth++) {
+        for (let i = 0; i < n; i++) {
+            for (let j = 0; j < n; j++) {
+                if (!depth) {
+                    dp[depth][i][j] = 1;
+                } else {
+                    for (let [dx, dy] of directions) {
+                        let [x, y] = [i + dx, j + dy];
+                        if (x >= 0 && x < n && y >= 0 && y < n) {
+                            dp[depth][i][j] += dp[depth - 1][x][y] / 8;
+                        }
+                    }
+                }
+                
+            }
+        }
+    }
+    return dp[k][row][column];
+};
+```
+
 ### **...**
 
 ```

solution/0600-0699/0688.Knight Probability in Chessboard/README_EN.md

@@ -62,6 +62,33 @@ The total probability the knight stays on the board is 0.0625.
 
 ```
 
+### **TypeScript**
+
+```ts
+function knightProbability(n: number, k: number, row: number, column: number): number {
+    let dp = Array.from({ length: k + 1 }, v => Array.from({ length: n }, w => new Array(n).fill(0)));
+    const directions = [[-2, -1], [-2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2], [2, -1], [2, 1]];
+    for (let depth = 0; depth <= k; depth++) {
+        for (let i = 0; i < n; i++) {
+            for (let j = 0; j < n; j++) {
+                if (!depth) {
+                    dp[depth][i][j] = 1;
+                } else {
+                    for (let [dx, dy] of directions) {
+                        let [x, y] = [i + dx, j + dy];
+                        if (x >= 0 && x < n && y >= 0 && y < n) {
+                            dp[depth][i][j] += dp[depth - 1][x][y] / 8;
+                        }
+                    }
+                }
+                
+            }
+        }
+    }
+    return dp[k][row][column];
+};
+```
+
 ### **...**
 
 ```

solution/0600-0699/0688.Knight Probability in Chessboard/Solution.ts

@@ -0,0 +1,22 @@
+function knightProbability(n: number, k: number, row: number, column: number): number {
+    let dp = Array.from({ length: k + 1 }, v => Array.from({ length: n }, w => new Array(n).fill(0)));
+    const directions = [[-2, -1], [-2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2], [2, -1], [2, 1]];
+    for (let depth = 0; depth <= k; depth++) {
+        for (let i = 0; i < n; i++) {
+            for (let j = 0; j < n; j++) {
+                if (!depth) {
+                    dp[depth][i][j] = 1;
+                } else {
+                    for (let [dx, dy] of directions) {
+                        let [x, y] = [i + dx, j + dy];
+                        if (x >= 0 && x < n && y >= 0 && y < n) {
+                            dp[depth][i][j] += dp[depth - 1][x][y] / 8;
+                        }
+                    }
+                }
+                
+            }
+        }
+    }
+    return dp[k][row][column];
+};