搜索算法 回溯法 79. Word Search

Given an m x n grid of characters board and a string word, return true if word exists in the grid.
The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.
Example 1:

直接过了，别忘写visited

class Solution {
public:
    vector<int> dir{-1,0,1,0,-1};
    bool exist(vector<vector<char>>& board, string word) {
        bool res = false;
        vector<vector<bool>> visited(board.size(), vector<bool>(board[0].size(),false));
        for(int i = 0; i < board.size(); i++){
            for(int j = 0; j < board[0].size(); j++){
                if(board[i][j] == word[0])
                    res = backtrack(board,word,visited,i,j,1);
                if(res)
                    return res;
            }
        }
        return res;
    }
    bool backtrack(vector<vector<char>>& board, string word,vector<vector<bool>> &visited, int i, int j, int index){
        if(index == word.size())
            return true;
        bool res = false;
        visited[i][j] = true;
        for(int k = 0; k < dir.size()-1; k++){
            int x = i + dir[k];
            int y = j + dir[k+1];
            if(x >= 0 && x < board.size() && y >= 0 && y < board[0].size() && board[x][y] == word[index] && !visited[x][y]){
                res |= backtrack(board,word,visited,x,y,index+1);
                if(res){
                    visited[i][j] = false;
                    return res;
                }
            }
        }
        visited[i][j] = false;
        return res;
    }
};