题目描述:
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 search(const vector<vector<char>>& board, int i, int j, string word, vector<vector<bool>>& visited)
{
if (word.length() == 0) return true;
int m = board.size();
int n = board[0].size();
int direction[4][2] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };
for (int k = 0; k < 4; ++k){
int ii = i + direction[k][0];
int jj = j + direction[k][1];
if (ii >= 0 && ii < m && jj >= 0 && jj < n && board[ii][jj] == word[0] && visited[ii][jj] == false){
visited[ii][jj] = true;
if (word.length() == 1 || search(board, ii, jj, word.substr(1), visited)){
return true;
}
visited[ii][jj] = false;
}
}
return false;
}
bool exist(vector<vector<char>>& board, string word)
{
if (word.length() == 0) return true;
if (board.size() == 0 || board[0].size() == 0) return false;
int m = board.size();
int n = board[0].size();
vector<vector<bool>> visited(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]){
visited[i][j] = true;
if (word.size() == 1 || search(board, i, j, word.substr(1), visited)){
return true;
}
visited[i][j] = false;
}
}
}
return false;
}
};