-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode079_Word_Search.cpp
More file actions
73 lines (58 loc) · 1.77 KB
/
LeetCode079_Word_Search.cpp
File metadata and controls
73 lines (58 loc) · 1.77 KB
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
61
62
63
64
65
66
67
68
69
70
71
72
73
class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
vector<vector<bool> > vis(board.size(), vector<bool>(board[0].size(), 0));
for(int i = 0; i < board.size(); i++)
{
for(int j = 0; j < board[0].size(); j++)
{
if(vis[i][j] == 0 && search(board, word, vis, i, j, 0))
{
return true;
}
}
}
return false;
}
bool search(vector<vector<char>>& board, string word, vector<vector<bool>>& vis, int x, int y, int pos)
{
if(board[x][y] == word[pos])
{
vis[x][y] = 1;
if(pos == word.size()-1)
{
return true;
}
if(x-1 >= 0 && vis[x-1][y] == 0)
{
if(search(board, word, vis, x-1, y, pos+1))
{
return true;
}
}
if(x+1 < board.size() && vis[x+1][y] == 0)
{
if(search(board, word, vis, x+1, y, pos+1))
{
return true;
}
}
if(y-1 >= 0 && vis[x][y-1] == 0)
{
if(search(board, word, vis, x, y-1, pos+1))
{
return true;
}
}
if(y+1 >= 0 && vis[x][y+1] == 0)
{
if(search(board, word, vis, x, y+1, pos+1))
{
return true;
}
}
vis[x][y] = 0;
}
return false;
}
};