Leetcode79. 单词搜索 -hot100

题目：

---

代码(首刷看解析 2024年3月7日)：

        不要在遍历体内部用word[count + 1]之类的操作，头会绕晕，感谢一个朋友教会我的小技巧

class Solution {
public://回溯
    bool is_find;
    void DFS(vector<vector<char>>& board, const string word, int count, int i, int j) {
        // 返回条件: count == word.size();
        if (is_find) return;
        if (count == word.size()) {
            is_find = true;
            return;
        }
        // DFS遍历board[i][j]的上下左右 + 判断边界
        board[i][j] = -board[i][j];
        char c = word[count];
        if (i - 1 >= 0 && board[i - 1][j] == c)
            DFS(board, word, count + 1, i - 1, j);

        if (i + 1 < board.size() && board[i + 1][j] == c)
            DFS(board, word, count + 1, i + 1, j);

        if (j - 1 >= 0 && board[i][j - 1] == c)
            DFS(board, word, count + 1, i, j - 1);

        if (j + 1 < board[0].size() && board[i][j + 1] == c)
            DFS(board, word, count + 1, i, j + 1);
        board[i][j] = -board[i][j];
    }
    bool exist(vector<vector<char>>& board, string word) {
        if (board.size() == 0) return false;
        is_find = false;
        for (int i = 0; i < board.size(); ++i) {
            for (int j = 0; j < board[0].size(); ++j) {
                if (board[i][j] == word[0])//找到正确的起始点，开始DFS
                    DFS(board, word, 1, i, j);
                if (is_find) return true;
            }
        }
        return false;
    }
};