问题描述
给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false
解题方法1
class Solution {
public boolean exist(char[][] board, String word) {
// 字符串转换成数组
char[] words = word.toCharArray();
for(int i = 0; i < board.length; ++i) {
for(int j = 0; j < board[0].length; ++j) {
if(dfs(board, words, i, j, 0)) return true;
}
}
return false;
}
boolean dfs(char[][] board, char[] word,int i, int j,int index) {
if(i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != word[index]) return false;
if(index == word.length-1) return true;
char tmp = board[i][j];
board[i][j] = '.';
index++;
// 递归
boolean res = dfs(board, word, i+1, j, index)
|| dfs(board, word, i-1, j, index)
|| dfs(board, word, i, j+1, index)
|| dfs(board, word, i, j-1, index);
board[i][j] = tmp;
return res;
}
}