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 =
[ ["ABCE"], ["SFCS"], ["ADEE"] ]word =
"ABCCED"
, -> returns
true
,
word =
"SEE"
, -> returns
true
,
word =
"ABCB"
, -> returns
false
.
class Solution {
public:
bool exist(vector
>& board, string word) {
int rowCount=board.size();
if(rowCount<=0) return false;
int colCount=board[0].size();
vector
> isVisited(rowCount,vector
(colCount,false)); for(int i=0;i
> &board, const string &word,int index, int x, int y, vector
> &visited){ if (index == word.size()) return true; // 收敛条件 if (x < 0 || y < 0 || x >= board.size() || y >= board[0].size()) return false; // 越界,终止条件 if (visited[x][y]) return false; // 已经访问过,剪枝 if (board[x][y] != word[index]) return false; // 不相等,剪枝 visited[x][y] = true; bool ret = dfs(board, word, index + 1, x - 1, y, visited) || // 上 dfs(board, word, index + 1, x + 1, y, visited) || // 下 dfs(board, word, index + 1, x, y - 1, visited) || // 左 dfs(board, word, index + 1, x, y + 1, visited); // 右 visited[x][y] = false;//!!!!!!!!!!! 每次递归回来都要清空自己设置的状态 return ret; } };