题目:单词搜索
给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,
其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
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和回溯,
dfs搜到答案就返回,标记访问的方法,防止重复访问
package leetCode.DFS;
public class lc_dfs_79_exist {
public static void main(String[] args) {
lc_dfs_79_exist m = new lc_dfs_79_exist();
char[][] board = {{'A', 'B', 'C', 'E'},
{'S', 'F', 'C', 'S'},
{'A', 'D', 'E', 'E'}};
System.out.println(m.exist(board, "ABCB"));
}
public boolean exist(char[][] board, String word) {
int n = board.length;
int m = board[0].length;
boolean[][] vis = new boolean[n][m];
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[i].length; j++) {
if (dfs(word, i, j, board, vis, 0)) {
return true;
}
}
}
return false;
}
public boolean dfs(String word, int i, int j, char[][] board, boolean[][] vis, int len) {
// 如果最后一个已经搜完,此时len=word.length(从0开始),则存在
if (len == word.length())
return true;
// 不符合的条件
if (i < 0 || i >= board.length || j < 0 || j >= board[0].length
|| vis[i][j] || board[i][j] != word.charAt(len))
return false;
vis[i][j] = true;
boolean res = dfs(word, i - 1, j, board, vis, len + 1) ||
dfs(word, i + 1, j, board, vis, len + 1) ||
dfs(word, i, j - 1, board, vis, len + 1) ||
dfs(word, i, j + 1, board, vis, len + 1);
// 回溯重新设为false,防止干扰下一次搜索
vis[i][j] = false;
return res;
}
}