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.
上面就是3个例子 现在想到的是回溯
用一个二维boolean数组标记每个节点是否在路径中出现过
char[][] board;
boolean[][] flags;
String word;
public boolean exist(char[][] board, String word) {
this.word = word;
this.board = new char[board.length+2][board[0].length+2];
flags = new boolean[board.length+2][board[0].length+2];
for(int i = 0;i < board.length+2;i++){
for(int j = 0;j < board[0].length+2;j++){
flags[i][j] = false;
}
}
for(int i = 0;i < board.length+2;i++){
if(i == 0 || i == board.length+1){
for(int j = 0;j < board[0].length+2;j++)
this.board[i][j] = '*';
}
else{
this.board[i][0] = '*';
for(int j = 0;j < board[0].length;j++)
this.board[i][j+1] = board[i-1][j];
this.board[i][board[0].length+1] = '*';
}
}
for(int i = 0;i < board.length;i++){
for(int j = 0;j < board[0].length;j++){
if(backtracking(i+1, j+1, 0))
return true;
}
}
return false;
}
public boolean backtracking(int i,int j,int index){
if(index == word.length())
return true;
else{
if(board[i][j] == word.charAt(index)){
flags[i][j] = true;
boolean result = false;
if(flags[i-1][j] == false)
result = result || backtracking(i-1, j, index+1);
if(flags[i+1][j] == false)
result = result || backtracking(i+1, j, index+1);
if(flags[i][j-1] == false)
result = result || backtracking(i, j-1, index+1);
if(flags[i][j+1] == false)
result = result || backtracking(i, j+1, index+1);
flags[i][j] = false;
return result;
}
else
return false;
}
}
再次注意:这种题为了简化边界的考虑 一定要加一圈’*’ 不然边界的处理很麻烦