Leetcode 79. Word Search (Medium) (cpp)
Tag: Array, Backtracking
Difficulty: Medium
/*
79. Word Search (Medium)
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 exist(vector<vector<char>>& board, string word) {
row = board.size();
col = board[0].size();
for (int i = 0; i < row; i ++) {
for (int j = 0; j < col; j++) {
if (search(board, word.c_str(), i, j)) return true;
}
}
return false;
}
private:
int row, col;
bool search(vector<vector<char>>& board, const char* w, int i, int j) {
if (i < 0 || i >= row || j < 0 || j >= col || board[i][j] == '\0' || board[i][j] != *w) return false;
else if (*(w + 1) == '\0') return true;
else {
char t = board[i][j];
board[i][j] = '\0';
if (search(board, w + 1, i + 1, j) || search(board, w + 1, i - 1, j) || search(board, w + 1, i, j - 1) ||search(board, w + 1, i, j + 1))
return true;
board[i][j] = t;
}
return false;
}
};