【LeetCode】Word Search

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.

Example:

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.

题解：回溯法，这道题刚开始一直错误是因为直接套之前模版，用dfs当成迷宫问题四个方向搜索，然后用vis标记每个点为一次搜索然后重置vis，这里的错误就在于vis的使用，因为每次搜索过的路径中的点下次搜索也可以访问，正确姿势应该是当前路径上搜索过的点不能访问以此来防止来回访问的回路以后要设置清楚vis的目的，这道题可以不需要vis，因为word上的点记录了访问点的信息，所以可以直接修改board的点为‘*’然后回溯回来时设置回去即可

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        for(int i = 0; i < board.size(); ++i)
        {
            for(int j = 0; j < board[0].size(); ++j)
            {
                if(adjacentSearch(board, word, i, j, 0))
                    return true;
            }
        }
        return false;
    
    }
protected:
    bool adjacentSearch(vector<vector<char>>& board, const string& word, int i, int j, int index)
    {
        if(index == word.size()) return true; 
        if(i < 0 || j < 0 || i > board.size()-1 || j > board[0].size()-1) return false; 
        if(board[i][j] != word[index]) return false; 
        board[i][j] = '*'; 
        bool furtherSearch =  adjacentSearch(board, word, i+1, j, index+1) || 
                              adjacentSearch(board, word, i-1, j, index+1) || 
                              adjacentSearch(board, word, i, j-1, index+1) || 
                              adjacentSearch(board, word, i, j+1, index+1);   
        
        board[i][j] = word[index]; 
        return furtherSearch;
    }
};