class Solution {
public:
bool exist(vector<vector<char>>& board, string word) {
if(board.size() == 0|| word.length() == 0) returnfalse;
int pos = 0;
for (int i = 0; i < board.size(); i++) {
for (int j = 0; j < board[0].size(); j++) {
if (SS(board, i, j, word, pos))
returntrue;
}
}
returnfalse;
}
bool SS(vector<vector<char>>& board, int i, int j, string word, int pos) {
if (pos == word.length()) returntrue;
if (i >= 0&&i < board.size()&&j >= 0&&j < board[0].size()&&board[i][j] == word[pos]) {
char t = board[i][j];
board[i][j] = '#';
if (SS(board, i+1, j, word, pos+1)||SS(board, i-1, j, word, pos+1)||SS(board, i, j+1, word, pos+1)||SS(board, i, j-1, word,pos+1)) returntrue;
board[i][j] = t;
}
returnfalse;
}
};