/
WordSearch.cpp
60 lines (58 loc) · 1.69 KB
/
WordSearch.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<vector>
#include<string>
#include<iostream>
using namespace std;
class Solution {
public:
bool exist(vector<vector<char> > &board, string word) {
if(word.empty())
return true;
if(board.empty()||board[0].empty())
return false;
int row=board.size();
int col=board[0].size();
int i;
int j;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
if(word[0]==board[i][j]&&dfs(word,i,j,0,board))
return true;
}
}
return false;
}
bool dfs(string word,int row,int col,int index,vector<vector<char> > &board)
{
if(index==(int)word.size()-1)
return true;
char c=board[row][col];
board[row][col]='#';
//up
if(row-1>=0&&board[row-1][col]==word[index+1])
if(dfs(word,row-1,col,index+1,board))
return true;
//down
if(row+1<(int)board.size()&&board[row+1][col]==word[index+1])
if(dfs(word,row+1,col,index+1,board))
return true;
//left
if(col-1>=0&&board[row][col-1]==word[index+1])
if(dfs(word,row,col-1,index+1,board))
return true;
//right
if(col+1<(int)board[0].size()&&board[row][col+1]==word[index+1])
if(dfs(word,row,col+1,index+1,board))
return true;
board[row][col]=c;
return false;
}
};
int main()
{
Solution s;
vector<vector<char> > vec={{'A','B','C','E'},{'S','F','C','S'},{'A','D','E','E'}};
string str="AB";
cout<<s.exist(vec,str)<<endl;
}