题目
给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false
提示:
board
和word
中只包含大写和小写英文字母。1 <= board.length <= 200
1 <= board[i].length <= 200
1 <= word.length <= 10^3
思路
dfs+回溯
代码
class Solution {
public boolean dfs(char[][] board, char[] word, boolean[][] visited, int i, int j, int idx, int m, int n){
if (idx == word.length)
return true;
int[] x = {-1, 0, 1, 0}, y = {0, 1, 0, -1};
for (int k=0; k<4; k++){
int i1 = i+x[k], j1 = j+y[k];
if (i1 >= 0 && i1 < m && j1 >= 0 && j1 < n && board[i1][j1] == word[idx] && !visited[i1][j1] ){
visited[i1][j1] = true;
if (dfs(board, word, visited, i1, j1, idx+1, m, n))
return true;
visited[i1][j1] = false;
}
}
return false;
}
public boolean exist(char[][] board, String word) {
int m = board.length, n = 0;
if (m > 0)
n = board[0].length;
boolean[][] visited = new boolean[m][n];
for (int i=0; i<m; i++){
for (int j=0; j<n; j++){
if (board[i][j] == word.charAt(0)){
visited[i][j] = true;
if (dfs(board, word.toCharArray(), visited, i, j, 1, m, n))
return true;
visited[i][j] = false;
}
}
}
return false;
}
}