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.

For example,
Given board =

[
[‘A’,’B’,’C’,’E’],
[‘S’,’F’,’C’,’S’],
[‘A’,’D’,’E’,’E’]
]
word = “ABCCED”, -> returns true,
word = “SEE”, -> returns true,
word = “ABCB”, -> returns false.

深搜+回溯
顺便吐槽一下LeetCode不给数据返回真的好吗，开一个标记数组都心惊胆战的~

class Solution {
public:
    int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};
    int m,n;
    char visit[1000][1000];

    bool exist(vector<vector<char>>& board, string word) {
        int m=board.size();
        int n=board[0].size();
        this->m=m;
        this->n=n;
        memset(visit,0,sizeof(visit));
        if(word.size()==0) return true;

        //遍历整个矩阵，寻找与word开头相同的字符
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(board[i][j]==word[0]){
                    //仅有一个字符
                    if(word.size()==1) return true;

                    int step=0;
                    visit[i][j]=1;
                    if(dfs(board,1,word,i,j)) return true;
                    memset(visit,0,sizeof(visit));
                }
            }
        }

        return false;
    }

    bool dfs(vector<vector<char>>& board,int step,string target,int x,int y){
        if(step==target.size()) return true;

        //遍历4个方向
        for(int i=0;i<4;i++){
            int next_x=x+dir[i][0];
            int next_y=y+dir[i][1];

            //越界处理
            if(next_x<0 || next_y<0 || next_x>=m || next_y>=n) continue;
            //已经访问过
            if(visit[next_x][next_y]) continue;
            //是否与当前需要访问的位置一致
            if(target[step]!=board[next_x][next_y]) continue;

            visit[next_x][next_y]=1;
            if(dfs(board,step+1,target,next_x,next_y)) return true;
            visit[next_x][next_y]=0;
        }

        return false;
    }
};