79. Word Search
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.
For example,
Given board =
[ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ]word =
"ABCCED"
, -> returns
true
,
word =
"SEE"
, -> returns
true
,
word =
"ABCB"
, -> returns
false
.
class Solution {
boolean DFS(char[][] board,int i,int j,String word,int index)
//只有到最后一个匹配上了才返回true
{
if(i > board.length-1 || i <0 || j<0 || j >board[0].length-1 || board[i][j]!=word.charAt(index))
{
return false;
}
if(board[i][j]==word.charAt(index)&&index==(word.length()-1))
//if(index==word.length())
//最后一个匹配上了
{
return true;
}
board[i][j]='*';//当前元素匹配上 后面不知道呢 不能重复访问 后面再变回来
boolean ans =DFS(board, i-1, j, word, index+1) ||
DFS(board, i, j-1, word, index+1) ||
DFS(board, i, j+1, word, index+1) ||
DFS(board, i+1, j, word, index+1);
board[i][j]=word.charAt(index);
return ans;
}
public boolean exist(char[][] board, String word)
{
if(board.length==0||word.length()==0)return false;
for(int i=0;i<board.length;i++)
{
for(int j=0;j<board[i].length;j++)
{
if(DFS(board,i,j,word,0))
{
return true;
}
}
}
return false;
}
}
class Solution {
boolean DFS(char[][] board,int i,int j,String word,int index)
//只有到最后一个匹配上了才返回true
{
if(i > board.length-1 || i <0 || j<0 || j >board[0].length-1 || board[i][j]!=word.charAt(index))
{
return false;
}
if(board[i][j]==word.charAt(index)&&index==(word.length()-1))
//if(index==word.length())
//最后一个匹配上了
{
return true;
}
board[i][j]='*';//当前元素匹配上 后面不知道呢 不能重复访问 后面再变回来
boolean ans =DFS(board, i-1, j, word, index+1) ||
DFS(board, i, j-1, word, index+1) ||
DFS(board, i, j+1, word, index+1) ||
DFS(board, i+1, j, word, index+1);
board[i][j]=word.charAt(index);
return ans;
}
public boolean exist(char[][] board, String word)
{
if(board.length==0||word.length()==0)return false;
for(int i=0;i<board.length;i++)
{
for(int j=0;j<board[i].length;j++)
{
if(DFS(board,i,j,word,0))
{
return true;
}
}
}
return false;
}
}