给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true.
给定 word = "SEE", 返回 true.
给定 word = "ABCB", 返回 false.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/word-search
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public boolean exist(char[][] board, String word) {
if(word.equals("")) return true;
char first = word.charAt(0);
int row = board.length;
if(row == 0) return false;
int col = board[0].length;
for(int i = 0; i < row; i++) {
for(int j = 0; j < col; j++) {
if(board[i][j] == first) {
if(existAtIJ(board, word, i, j, 0)) return true;
}
}
}
return false;
}
public boolean existAtIJ(char[][] board, String word, int i, int j, int index) {
if(index == word.length()) return true;
if(i < 0 || i >= board.length || j < 0 || j >= board[0].length) return false;
if(board[i][j] != word.charAt(index)) return false;
boolean res;
board[i][j] <<= 2; // 防止同一元素被重复使用
res = existAtIJ(board, word, i-1, j, index+1) ||
existAtIJ(board, word, i+1, j, index+1) ||
existAtIJ(board, word, i, j-1, index+1) ||
existAtIJ(board, word, i, j+1, index+1);
board[i][j] >>= 2;
return res;
}
}