79. 单词搜索
给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例 1:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “ABCCED”
输出:true
示例 2:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “SEE”
输出:true
示例 3:
输入:board = [[“A”,“B”,“C”,“E”],[“S”,“F”,“C”,“S”],[“A”,“D”,“E”,“E”]], word = “ABCB”
输出:false
提示:
m == board.length
n = board[i].length
1 <= m, n <= 6
1 <= word.length <= 15
board 和 word 仅由大小写英文字母组成
class Solution {
public:
bool isoverbound(int x, int y, int m, int n) {
return x < 0 || y < 0 || x >= m || y >= n;
}
bool dfs(vector<vector<char>>& board, string word, vector<vector<bool>>& visit, int x, int y, int loc) {
int m = board.size(), n = board[0].size();
if (loc >= word.size()) {
return true;
}
if (isoverbound(x, y, m, n)) {
return false;
}
if (board[x][y] != word.at(loc) || visit[x][y]) {
return false;
}
visit[x][y] = true;
if (dfs(board, word, visit, x - 1, y, loc + 1) ||
dfs(board, word, visit, x + 1, y, loc + 1) ||
dfs(board, word, visit, x, y - 1, loc + 1) ||
dfs(board, word, visit, x, y + 1, loc + 1)) {
return true;
}
visit[x][y] = false;
return false;
}
bool exist(vector<vector<char>>& board, string word) {
int m = board.size(), n = board[0].size();
if (word.size() > m * n) {
return false;
}
vector<vector<bool>> visit(m, vector<bool>(n, false));
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (word[0] == board[i][j]) {
if (dfs(board, word, visit, i, j, 0)) {
return true;
}
}
}
}
return false;
}
};