给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board =
[
['A','B','C','E'],
['S','F','C','S'],
['A','D','E','E']
]
给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false
class Solution {
private:
bool dfs(vector<vector<char>>& board, string& word, int size, int x, int y, vector<vector<int>>& vis)
{
if(size == word.size()) return true;
//cout << board[x][y] << " " << x << " " << y << endl;
if(x<0 || y<0 || x>=board.size() || y>=board[0].size()) return false;
if(board[x][y] != word[size]) return false;
if(!vis[x][y])
{
vis[x][y] = 1;
if(dfs(board, word, size+1, x+1, y, vis)
|| dfs(board, word, size+1, x-1, y, vis)
|| dfs(board, word, size+1, x, y+1, vis)
|| dfs(board, word, size+1, x, y-1, vis))
return true;
vis[x][y] = 0;
}
return false;
}
public:
bool exist(vector<vector<char>>& board, string word) {
if(board.empty() || word.empty()) return false;
int row = board.size();
int col = board[0].size();
vector<vector<int>> vis(row, vector<int>(col, 0));
for(int i=0; i<row; i++)
{
for(int j=0;j<col;j++)
{
if(dfs(board, word, 0, i, j, vis)) return true;
}
}
return false;
}
};