package LeetCode;
/*
79. 单词搜索
给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true.
给定 word = "SEE", 返回 true.
给定 word = "ABCB", 返回 false.
*/
public class Exist {
public boolean exist(char[][] board, String word) {
char[] wordchar=word.toCharArray();
Boolean res=false;
int[][] change={{0,1},{1,0},{0,-1},{-1,0}};
if (word.length()==0||board.length==0||board[0].length==0)return res;
for (int i = 0; i <board.length ; i++) {
for (int j = 0; j <board[0].length ; j++) {
if (board[i][j]==wordchar[0]){
res=dfs(0,i,j,board,wordchar,change);
if (res)return res;
}
}
}
return res;
}
public boolean dfs(int wori,int starti,int startj,char[][] board,char[] wordchar,int[][] changge){
if(wordchar[wori]!=board[starti][startj])return false;
//是否为最后一个并且成立
if(wori==wordchar.length-1){
return true;
}
char a=board[starti][startj];
//能到达则进行标志
board[starti][startj]='#';
for (int i = 0; i <4 ; i++) {
int indexi=starti+changge[i][0];
int indexj=startj+changge[i][1];
//先进行剪枝
if (indexi>=0&&indexi<board.length&&indexj>=0&&indexj<board[0].length&&board[indexi][indexj]!='#'){
//进行返回结果
if (dfs(wori+1,indexi,indexj,board,wordchar,changge))return true;
}
}
board[starti][startj]=a;
return false;
}
public static void main(String[] args) {
Exist e=new Exist();
char[][] a={{'A','B','C','E'},
{'S','F','C','S'},
{'A','D','E','E'}};
System.out.println(e.exist(a,"ABCCED"));
}
}