给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true.
给定 word = "SEE", 返回 true.
给定 word = "ABCB", 返回 false.
方法:深度优先搜索
class Solution {
private static int[] row = new int[] {0, 1, 0, -1};
private static int[] col = new int[] {1, 0, -1 , 0};
public boolean exist(char[][] board, String word) {
int m = board.length;
int n = board[0].length;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if(dfs(i, j, board, word, 0))
return true;
}
}
return false;
}
public static boolean dfs(int x, int y, char[][] board, String word, int index){
if(x >= board.length || x < 0 || y < 0 || y >= board[0].length)
return false;
if(board[x][y] != word.charAt(index))
return false;
if(index == word.length - 1)
return true;
board[x][y] = '.';
for(int i = 0; i < 4; i++){
if(dfs(x + row[i], y + col[i], board, word, index + 1))
return true;
}
board[x][y] = word.charAt(index);//还原状态
return false;
}
}