79. 单词搜索
给定一个二维网格和一个单词,找出该单词是否存在于网格中。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
示例:
board = [ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ] 给定 word = "ABCCED", 返回 true. 给定 word = "SEE", 返回 true. 给定 word = "ABCB", 返回 false.
class Solution {
public:
int DFS(vector<vector<int>>& vis,vector<vector<char>>& board,string word,int index,int x,int y){
vector<int>xindex = {0,1,0,-1};
vector<int>yindex = {1,0,-1,0};
if(word.size() <= index) return 1;
for(int i = 0;i < 4;i++){
if(x + xindex[i] < 0 || x + xindex[i] >= board.size()) continue;
if(y + yindex[i] < 0 || y + yindex[i] >= board[0].size()) continue;
if(board[x + xindex[i]][y + yindex[i]] == word[index] && vis[x + xindex[i]][y + yindex[i]] == 0){
vis[x + xindex[i]][y + yindex[i]] = 1;
if(DFS(vis,board,word,index + 1,x + xindex[i],y + yindex[i]) == 1) return 1;
vis[x + xindex[i]][y + yindex[i]] = 0;
}
}
return 0;
}
bool exist(vector<vector<char>>& board, string word) {
int ans = 0;
vector<vector<int>>vis(board.size(),vector<int>(board[0].size(),0));
for(int i = 0;i < board.size();i++){
for(int j = 0;j < board[i].size();j++){
if(board[i][j] == word[0]){
vis[i][j] = 1;
if(DFS(vis,board,word,1,i,j) == 1){
ans = 1;
break;
}
vis[i][j] = 0;
}
}
if(ans == 1) break;
}
if(ans == 1) return true;
return false;
}
};
解题思路:这题就是基本的深度优先搜索加回溯,没什么好说的,就基本的算法。