feat: add solutions to lcof problem: No.12

面试题12. 矩阵中的路径

Author: YangFong

lcof/面试题12. 矩阵中的路径/README.md

@@ -240,6 +240,83 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function exist(board: string[][], word: string): boolean {
+    const m = board.length;
+    const n = board[0].length;
+    const dfs = (y: number, x: number, i: number) => {
+        if (i === word.length) {
+            return true;
+        }
+        if ((board[y] || [])[x] !== word[i]) {
+            return false;
+        }
+        const temp = board[y][x];
+        board[y][x] = '';
+        if (
+            dfs(y + 1, x, i + 1) ||
+            dfs(y, x + 1, i + 1) ||
+            dfs(y - 1, x, i + 1) ||
+            dfs(y, x - 1, i + 1)
+        ) {
+            return true;
+        }
+        board[y][x] = temp;
+        return false;
+    };
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (dfs(i, j, 0)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(board: &mut Vec<Vec<char>>, chars: &Vec<char>, y: usize, x: usize, i: usize) -> bool {
+        if board[y][x] != chars[i] {
+            return false;
+        }
+        if i + 1 == chars.len() {
+            return true;
+        }
+        let temp = board[y][x];
+        board[y][x] = ' ';
+        if y != 0 && Solution::dfs(board, chars, y - 1, x, i + 1)
+            || x != 0 && Solution::dfs(board, chars, y, x - 1, i + 1)
+            || y != board.len() - 1 && Solution::dfs(board, chars, y + 1, x, i + 1)
+            || x != board[0].len() - 1 && Solution::dfs(board, chars, y, x + 1, i + 1)
+        {
+            return true;
+        }
+        board[y][x] = temp;
+        false
+    }
+
+    pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
+        let m = board.len();
+        let n = board[0].len();
+        let chars = word.chars().collect::<Vec<char>>();
+        for i in 0..m {
+            for j in 0..n {
+                if Solution::dfs(&mut board, &chars, i, j, 0) {
+                    return true;
+                }
+            }
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题12. 矩阵中的路径/Solution.rs

@@ -0,0 +1,35 @@
+impl Solution {
+    fn dfs(board: &mut Vec<Vec<char>>, chars: &Vec<char>, y: usize, x: usize, i: usize) -> bool {
+        if board[y][x] != chars[i] {
+            return false;
+        }
+        if i + 1 == chars.len() {
+            return true;
+        }
+        let temp = board[y][x];
+        board[y][x] = ' ';
+        if y != 0 && Solution::dfs(board, chars, y - 1, x, i + 1)
+            || x != 0 && Solution::dfs(board, chars, y, x - 1, i + 1)
+            || y != board.len() - 1 && Solution::dfs(board, chars, y + 1, x, i + 1)
+            || x != board[0].len() - 1 && Solution::dfs(board, chars, y, x + 1, i + 1)
+        {
+            return true;
+        }
+        board[y][x] = temp;
+        false
+    }
+
+    pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
+        let m = board.len();
+        let n = board[0].len();
+        let chars = word.chars().collect::<Vec<char>>();
+        for i in 0..m {
+            for j in 0..n {
+                if Solution::dfs(&mut board, &chars, i, j, 0) {
+                    return true;
+                }
+            }
+        }
+        false
+    }
+}

lcof/面试题12. 矩阵中的路径/Solution.ts

@@ -0,0 +1,32 @@
+function exist(board: string[][], word: string): boolean {
+    const m = board.length;
+    const n = board[0].length;
+    const dfs = (y: number, x: number, i: number) => {
+        if (i === word.length) {
+            return true;
+        }
+        if ((board[y] || [])[x] !== word[i]) {
+            return false;
+        }
+        const temp = board[y][x];
+        board[y][x] = '';
+        if (
+            dfs(y + 1, x, i + 1) ||
+            dfs(y, x + 1, i + 1) ||
+            dfs(y - 1, x, i + 1) ||
+            dfs(y, x - 1, i + 1)
+        ) {
+            return true;
+        }
+        board[y][x] = temp;
+        return false;
+    };
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (dfs(i, j, 0)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}