79.单词搜索

给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中，返回 true ；否则，返回 false 。

单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。

示例 1：

输入：board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出：true

思路：

dfs + 回溯，check(i,j,k)表示从board[i][j]开始是否能找到word从第k位开始的后缀，注意用visited数组存储节点是否被访问过。

class Solution {
public:
    int directions[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    bool check(vector<vector<char>>& board, vector<vector<bool>>& visited, int i, int j, int k, string word) {
        if (board[i][j] != word[k]) return false;
        else if (k == word.size() - 1) return true;
            for (auto dir : directions) {
                int new_i = i + dir[0];
                int new_j = j + dir[1];
                if (new_i >= 0 && new_i <board.size() && new_j >=0 && new_j < board[0].size())
                {
                    if (!visited[new_i][new_j])
                    {
                    visited[new_i][new_j] = true;
                    bool flag = check(board, visited, new_i, new_j, k+1, word);
                    if (flag == true) return true;
                    visited[new_i][new_j] = false;
                    }
                }
            }
            return false;
    }
    bool exist(vector<vector<char>>& board, string word) {
        vector<vector<bool>> visited(board.size(), vector<bool>(board[0].size()));
        for (int i = 0; i < board.size(); i++)
        {
            for (int j = 0; j < board[0].size(); j++)
            {
                visited[i][j] = true;
                bool flag = check (board, visited, i, j, 0, word);
                if (flag == true) return true;
                visited[i][j] = false;
            }
        }
        return false;
    }
};