回溯：212、单词搜索II

思路：在1的基础上，搜索words中的每一个单词是否满足即可。

 

class Solution {
public:
    int dir[4][4]={{0,-1},{1,0},{0,1},{-1,0}};
    vector<string> findWords(vector<vector<char>>& board, vector<string>& words) {
        vector<string>res;
        for(int i=0;i<words.size();i++){
            if(exist(board,words[i]))
                res.push_back(words[i]);
        }
        return res;
    } 
    bool exist(vector<vector<char>>& board, string word) {
        int m=board.size();
        int n=board[0].size();
        vector<vector<bool>> visited(m,vector<bool>(n));
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(dfs(i,j,0,board,word,visited))
                    return true;
            }
        }
        return false;
    }
    bool dfs(int x,int y,int index,vector<vector<char>>& board,string &word,vector<vector<bool>>& visited){
        if(index==word.size()-1){
            return word[index]==board[x][y];
        } 
        if(word[index]==board[x][y]){
            visited[x][y]=true;
            for(int i=0;i<4;i++){
                int new_x=x+dir[i][0];
                int new_y=y+dir[i][1];
                if(new_x>=0&&new_x<board.size()&&new_y>=0&&new_y<board[0].size()&&!visited[new_x][new_y])
                    if(dfs(new_x,new_y,index+1,board,word,visited))
                        return true;
            }
            visited[x][y]=false;   
        }
        return false;
    }
};