给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例 1:
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出:true
示例 2:
输入:board = [["a","b"],["c","d"]], word = "abcd"
输出:false
方法:回溯+递归
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;
}
public boolean dfs(char[][] board, char[] words, int i, int j, int index){
if(i<0||i>=board.length||j<0||j>=board[0].length||board[i][j]!=words[index]){
return false;
}
if(index==words.length-1){
return true;
}
//把当前坐标的值保存下来,为了在最后复原
char tmp = board[i][j];
//然后修改当前坐标的值
board[i][j] = '.';
boolean res = dfs(board, words,i+1,j, index+1) || dfs(board, words,i-1,j, index+1) ||
dfs(board, words,i,j+1, index+1) || dfs(board, words,i,j-1, index+1);
//递归之后再把当前的坐标复原
board[i][j] = tmp;
return res;
}
}
讲解在那本pdf上。