feat: add solutions to lc problem: No.1706

No.1706.Where Will the Ball Fall

Author: YangFong

solution/1700-1799/1706.Where Will the Ball Fall/README.md

@@ -210,6 +210,69 @@ func findBall(grid [][]int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findBall(grid: number[][]): number[] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const res = new Array(n).fill(0);
+    const dfs = (i: number, j: number) => {
+        if (i === m) {
+            return j;
+        }
+        if (grid[i][j] === 1) {
+            if (j === n - 1 || grid[i][j + 1] === -1) {
+                return -1;
+            }
+            return dfs(i + 1, j + 1);
+        } else {
+            if (j === 0 || grid[i][j - 1] === 1) {
+                return -1;
+            }
+            return dfs(i + 1, j - 1);
+        }
+    };
+    for (let i = 0; i < n; i++) {
+        res[i] = dfs(0, i);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(grid: &Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() {
+            return j as i32;
+        }
+        if grid[i][j] == 1 {
+            if j == grid[0].len() - 1 || grid[i][j + 1] == -1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j + 1)
+        } else {
+            if j == 0 || grid[i][j - 1] == 1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j - 1)
+        }
+    }
+
+    pub fn find_ball(grid: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = vec![0; n];
+        for i in 0..n {
+            res[i] = Self::dfs(&grid, 0, i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1706.Where Will the Ball Fall/README_EN.md

@@ -191,6 +191,69 @@ func findBall(grid [][]int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findBall(grid: number[][]): number[] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const res = new Array(n).fill(0);
+    const dfs = (i: number, j: number) => {
+        if (i === m) {
+            return j;
+        }
+        if (grid[i][j] === 1) {
+            if (j === n - 1 || grid[i][j + 1] === -1) {
+                return -1;
+            }
+            return dfs(i + 1, j + 1);
+        } else {
+            if (j === 0 || grid[i][j - 1] === 1) {
+                return -1;
+            }
+            return dfs(i + 1, j - 1);
+        }
+    };
+    for (let i = 0; i < n; i++) {
+        res[i] = dfs(0, i);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(grid: &Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() {
+            return j as i32;
+        }
+        if grid[i][j] == 1 {
+            if j == grid[0].len() - 1 || grid[i][j + 1] == -1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j + 1)
+        } else {
+            if j == 0 || grid[i][j - 1] == 1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j - 1)
+        }
+    }
+
+    pub fn find_ball(grid: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = vec![0; n];
+        for i in 0..n {
+            res[i] = Self::dfs(&grid, 0, i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1706.Where Will the Ball Fall/Solution.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    fn dfs(grid: &Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() {
+            return j as i32;
+        }
+        if grid[i][j] == 1 {
+            if j == grid[0].len() - 1 || grid[i][j + 1] == -1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j + 1)
+        } else {
+            if j == 0 || grid[i][j - 1] == 1 {
+                return -1;
+            }
+            Self::dfs(grid, i + 1, j - 1)
+        }
+    }
+
+    pub fn find_ball(grid: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = vec![0; n];
+        for i in 0..n {
+            res[i] = Self::dfs(&grid, 0, i);
+        }
+        res
+    }
+}

solution/1700-1799/1706.Where Will the Ball Fall/Solution.ts

@@ -0,0 +1,25 @@
+function findBall(grid: number[][]): number[] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const res = new Array(n).fill(0);
+    const dfs = (i: number, j: number) => {
+        if (i === m) {
+            return j;
+        }
+        if (grid[i][j] === 1) {
+            if (j === n - 1 || grid[i][j + 1] === -1) {
+                return -1;
+            }
+            return dfs(i + 1, j + 1);
+        } else {
+            if (j === 0 || grid[i][j - 1] === 1) {
+                return -1;
+            }
+            return dfs(i + 1, j - 1);
+        }
+    };
+    for (let i = 0; i < n; i++) {
+        res[i] = dfs(0, i);
+    }
+    return res;
+}