DFS搜索+回溯....遍历每一个可能的路径且要mark已经走过的路径避免重复原路径,当找到符合条件的路径后返回,否则要将mark过的路径还原以便之后的搜索....
public class Solution {
boolean flag;
public boolean exist(char[][] board, String word) {
flag=false;
for( int i=0;i<board.length;i++ )
{
for( int j=0;j<board[0].length;j++ )
{
if( board[i][j]==word.charAt(0) )
{
board[i][j]='0';
fun( board,i,j,word,1 );
board[i][j]=word.charAt(0);
}
}
}
return flag;
}
void fun( char[][] board, int x, int y, String word, int index )
{
if( index>=word.length() )
{
flag=true;
}
if( flag==true )
{
return ;
}
board[x][y]='0';
if( x<board.length-1&&board[x+1][y]==word.charAt(index) )
{
fun( board,x+1,y,word,index+1 );
}
if( x>0&&board[x-1][y]==word.charAt(index) )
{
fun( board,x-1,y,word,index+1 );
}
if( y<board[0].length-1&&board[x][y+1]==word.charAt(index) )
{
fun( board,x,y+1,word,index+1 );
}
if( y>0&&board[x][y-1]==word.charAt(index) )
{
fun( board,x,y-1,word,index+1 );
}
board[x][y]=word.charAt(index-1);
}
}