LeetCode 79. 单词搜索

原题目：https://leetcode-cn.com/problems/word-search/

 

思路：

简单的回溯算法，开一个数组记录访问过得节点

 

代码：

class Solution {
    bool flag=false;
    void dfs(vector<vector<char>>& board,string& word,vector<vector<int>>& v,int x,int y,int n){
        if(flag) return;
        if(x>=board.size() || x<0 || y<0 || y>=board[0].size()||v[x][y] || board[x][y] != word[n]) return;
        if(n==word.size()-1){
            flag=true;return;
        }
        v[x][y]=1;
        dfs(board,word,v,x-1,y,n+1);
        dfs(board,word,v,x+1,y,n+1);
        dfs(board,word,v,x,y-1,n+1);
        dfs(board,word,v,x,y+1,n+1);
        v[x][y]=0;
    }
public:
    bool exist(vector<vector<char>>& board, string word) {
        vector<vector<int>> v(board.size(),vector<int>(board[0].size(),0));
        for(int i=0;i<board.size();i++){
            for(int j=0;j<board[0].size();j++){
                dfs(board,word,v,i,j,0);
            }
        }
        return flag;
    }
};