class Solution {
public boolean exist(char[][] board, String word) {
char[] woardArray = word.toCharArray();
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[i].length; j++) {
if (dfs(board, woardArray, i, j, 0)) return true;
}
}
return false;
}
private boolean dfs(char[][] board, char[] woardArray, int i, int j, int k) {
if (i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != woardArray[k]) {
return false;
}
if (k == woardArray.length - 1) return true;
board[i][j] = '\0';
boolean res = dfs(board, woardArray, i + 1, j, k + 1) || dfs(board, woardArray, i - 1, j, k + 1)
|| dfs(board, woardArray, i, j + 1, k + 1) || dfs(board, woardArray, i, j - 1, k + 1);
board[i][j] = woardArray[k];
return res;
}
}
剑指offer12 矩阵中的路径
最新推荐文章于 2024-10-13 23:27:44 发布