feat: add solutions to lcci problem: No.08.02

No.08.02.Robot in a Grid

Author: YangFong

lcci/08.02.Robot in a Grid/README.md

@@ -50,6 +50,62 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function pathWithObstacles(obstacleGrid: number[][]): number[][] {
+    const m = obstacleGrid.length;
+    const n = obstacleGrid[0].length;
+    const res = [];
+    const dfs = (i: number, j: number): boolean => {
+        if (i === m || j === n || obstacleGrid[i][j] === 1) {
+            return false;
+        }
+        res.push([i, j]);
+        obstacleGrid[i][j] = 1;
+        if ((i + 1 === m && j + 1 === n) || dfs(i + 1, j) || dfs(i, j + 1)) {
+            return true;
+        }
+        res.pop();
+        return false;
+    };
+    if (dfs(0, 0)) {
+        return res;
+    }
+    return [];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, path: &mut Vec<Vec<i32>>, i: usize, j: usize) -> bool {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 1 {
+            return false;
+        }
+        path.push(vec![i as i32, j as i32]);
+        grid[i as usize][j as usize] = 1;
+        if (i + 1 == grid.len() && j + 1 == grid[0].len())
+            || Self::dfs(grid, path, i + 1, j)
+            || Self::dfs(grid, path, i, j + 1)
+        {
+            return true;
+        }
+        path.pop();
+        false
+    }
+
+    pub fn path_with_obstacles(mut obstacle_grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        if Self::dfs(&mut obstacle_grid, &mut res, 0, 0) {
+            return res;
+        }
+        vec![]
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/08.02.Robot in a Grid/README_EN.md

@@ -52,6 +52,62 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function pathWithObstacles(obstacleGrid: number[][]): number[][] {
+    const m = obstacleGrid.length;
+    const n = obstacleGrid[0].length;
+    const res = [];
+    const dfs = (i: number, j: number): boolean => {
+        if (i === m || j === n || obstacleGrid[i][j] === 1) {
+            return false;
+        }
+        res.push([i, j]);
+        obstacleGrid[i][j] = 1;
+        if ((i + 1 === m && j + 1 === n) || dfs(i + 1, j) || dfs(i, j + 1)) {
+            return true;
+        }
+        res.pop();
+        return false;
+    };
+    if (dfs(0, 0)) {
+        return res;
+    }
+    return [];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, path: &mut Vec<Vec<i32>>, i: usize, j: usize) -> bool {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 1 {
+            return false;
+        }
+        path.push(vec![i as i32, j as i32]);
+        grid[i as usize][j as usize] = 1;
+        if (i + 1 == grid.len() && j + 1 == grid[0].len())
+            || Self::dfs(grid, path, i + 1, j)
+            || Self::dfs(grid, path, i, j + 1)
+        {
+            return true;
+        }
+        path.pop();
+        false
+    }
+
+    pub fn path_with_obstacles(mut obstacle_grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        if Self::dfs(&mut obstacle_grid, &mut res, 0, 0) {
+            return res;
+        }
+        vec![]
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/08.02.Robot in a Grid/Solution.rs

@@ -0,0 +1,25 @@
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, path: &mut Vec<Vec<i32>>, i: usize, j: usize) -> bool {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 1 {
+            return false;
+        }
+        path.push(vec![i as i32, j as i32]);
+        grid[i as usize][j as usize] = 1;
+        if (i + 1 == grid.len() && j + 1 == grid[0].len())
+            || Self::dfs(grid, path, i + 1, j)
+            || Self::dfs(grid, path, i, j + 1)
+        {
+            return true;
+        }
+        path.pop();
+        false
+    }
+
+    pub fn path_with_obstacles(mut obstacle_grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        if Self::dfs(&mut obstacle_grid, &mut res, 0, 0) {
+            return res;
+        }
+        vec![]
+    }
+}

lcci/08.02.Robot in a Grid/Solution.ts

@@ -0,0 +1,21 @@
+function pathWithObstacles(obstacleGrid: number[][]): number[][] {
+    const m = obstacleGrid.length;
+    const n = obstacleGrid[0].length;
+    const res = [];
+    const dfs = (i: number, j: number): boolean => {
+        if (i === m || j === n || obstacleGrid[i][j] === 1) {
+            return false;
+        }
+        res.push([i, j]);
+        obstacleGrid[i][j] = 1;
+        if ((i + 1 === m && j + 1 === n) || dfs(i + 1, j) || dfs(i, j + 1)) {
+            return true;
+        }
+        res.pop();
+        return false;
+    };
+    if (dfs(0, 0)) {
+        return res;
+    }
+    return [];
+}