Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
Example:
board = [ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ] Given word = "ABCCED", return true. Given word = "SEE", return true. Given word = "ABCB", return false.
解法:
1、DFS,搜索到有一个路径即可。
class Solution {
public boolean exist(char[][] board, String word) {
int len = word.length();
//if(len == 0)return true;
if(board.length == 0 || board[0].length == 0)return false;
int n = board[0].length;//竖
int m = board.length;//横
int[][] visit = new int[m][n];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
visit[i][j] = 0;
}
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(findAns(board,visit,word,0,i,j))return true; //笨了,这里应该是逐个判断
}
}
return false;
}
public boolean findAns(char[][] board,int[][] visit, String word,int index,int m,int n){
if(index == word.length()){
return true;
}
int y = board[0].length;
int x = board.length;
//先判断当前字母的情况
if(m>x-1 || n>y-1 || m<0 || n<0 || visit[m][n]==1 || board[m][n]!=word.charAt(index)){
return false;
}
visit[m][n] = 1;
boolean res = findAns(board,visit,word,index+1,m+1,n) ||
findAns(board,visit,word,index+1,m,n+1) ||
findAns(board,visit,word,index+1,m-1,n) ||
findAns(board,visit,word,index+1,m,n-1) ;
visit[m][n] = 0; //需要回退
return res;
}
}