题目:
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
.
分析:
代码:
class Solution {
public:
bool res=false;
bool exist(vector<vector<char>>& board, string word) {
int m=board.size();
if(m<1)return false;
int n=board[0].size();
vector<vector<bool>> record(m,vector<bool>(n,false));
for(int i=0;i<m;++i)
for(int j=0;j<n;++j)
if(board[i][j]==word[0]){
record[i][j]=true;
dfs(record,board,i,j,1,word);
record[i][j]=false;
}
return res;
}
void dfs(vector<vector<bool>>& record,vector<vector<char>>& board,int si,int sj,int pos,string& word){
if(pos==word.size()){
res=true;return;
}
if(!res){
if(si>0&&board[si-1][sj]==word[pos]&&!record[si-1][sj]){
record[si-1][sj]=true;
dfs(record,board,si-1,sj,pos+1,word);
record[si-1][sj]=false;
}
if(sj>0&&board[si][sj-1]==word[pos]&&!record[si][sj-1]){
record[si][sj-1]=true;
dfs(record,board,si,sj-1,pos+1,word);
record[si][sj-1]=false;
}
if(si<board.size()-1&&board[si+1][sj]==word[pos]&&!record[si+1][sj]){
record[si+1][sj]=true;
dfs(record,board,si+1,sj,pos+1,word);
record[si+1][sj]=false;
}
if(sj<board[0].size()-1&&board[si][sj+1]==word[pos]&&!record[si][sj+1]){
record[si][sj+1]=true;
dfs(record,board,si,sj+1,pos+1,word);
record[si][sj+1]=false;
}
}
}
};