1391. Check if There is a Valid Path in a Grid

就是很基础的dfs的问题。只要确定好在什么位置，哪些点能走就可以，然后逐级递推，得到最后判断结果。

class Solution {
public:// dfs problems
    
    bool dfs(vector<vector<int>>& grid, vector<vector<int>>& visits, int x, int y){
        int row = grid.size();
        int col = grid[0].size();
        
        if (x==row-1&&y==col-1){
            return true;
        }
        // go (x,y) neighborhood
        if (grid[x][y]==1){ // [x][y+1]
            if (y+1<col&&visits[x][y+1]==0&&(grid[x][y+1]==1||grid[x][y+1]==3||grid[x][y+1]==5)){
                visits[x][y+1]=1;
                if (dfs(grid, visits, x, y+1)){return true;}
                visits[x][y+1]=0;
            } //[x, y-1]
            if (y-1>=0&&visits[x][y-1]==0&&(grid[x][y-1]==1||grid[x][y-1]==4||grid[x][y-1]==6)){
                visits[x][y-1]=1;
                if (dfs(grid, visits, x, y-1)){return true;}
                visits[x][y-1]=0;
            }
        }
        else if (grid[x][y]==2){ // [x-1, y]
            if (x-1>=0&&visits[x-1][y]==0&&(grid[x-1][y]==2||grid[x-1][y]==3||grid[x-1][y]==4)){
                visits[x-1][y]=1;
                if (dfs(grid, visits, x-1, y)){return true;}
                visits[x-1][y]=0;
            } //[x+1, y]
            if (x+1<row&&visits[x+1][y]==0&&(grid[x+1][y]==2||grid[x+1][y]==5||grid[x+1][y]==6)){
                visits[x+1][y]=1;
                if (dfs(grid, visits, x+1, y)){return true;}
                visits[x+1][y]=0;
            } //[x, y-1]
        }
        else if (grid[x][y]==3){ // [x, y-1] 146  [x+1,y] 256
            if (y-1>=0&&visits[x][y-1]==0&&(grid[x][y-1]==1||grid[x][y-1]==4||grid[x][y-1]==6)){
                visits[x][y-1]=1;
                if (dfs(grid, visits, x, y-1)){return true;}
                visits[x][y-1]=0;
            }
            if (x+1<row&&visits[x+1][y]==0&&(grid[x+1][y]==2||grid[x+1][y]==5||grid[x+1][y]==6)){
                visits[x+1][y]=1;
                if (dfs(grid, visits, x+1, y)){return true;}
                visits[x+1][y]=0;
            } //[x, y-1]
        }
        else if (grid[x][y]==4){ // [x,y+1] 135 [x+1,y] 256
            if (x+1<row&&visits[x+1][y]==0&&(grid[x+1][y]==2||grid[x+1][y]==5||grid[x+1][y]==6)){
                visits[x+1][y]=1;
                if (dfs(grid, visits, x+1, y)){return true;}
                visits[x+1][y]=0;
            } //[x, y-1]
            if (y+1<col&&visits[x][y+1]==0&&(grid[x][y+1]==1||grid[x][y+1]==3||grid[x][y+1]==5)){
                visits[x][y+1]=1;
                if (dfs(grid, visits, x, y+1)){return true;}
                visits[x][y+1]=0;
            }
        }
        else if (grid[x][y]==5){ // [x-1,y] 234 [x,y-1] 146
             if (x-1>=0&&visits[x-1][y]==0&&(grid[x-1][y]==2||grid[x-1][y]==3||grid[x-1][y]==4)){
                visits[x-1][y]=1;
                if (dfs(grid, visits, x-1, y)){return true;}
                visits[x-1][y]=0;
            }
            if (y-1>=0&&visits[x][y-1]==0&&(grid[x][y-1]==1||grid[x][y-1]==4||grid[x][y-1]==6)){
                visits[x][y-1]=1;
                if (dfs(grid, visits, x, y-1)){return true;}
                visits[x][y-1]=0;
            }
        }
        else if (grid[x][y]==6){ // (x-1,y): 234 (x,y+1) 135
            if (x-1>=0&&visits[x-1][y]==0&&(grid[x-1][y]==2||grid[x-1][y]==3||grid[x-1][y]==4)){
                visits[x-1][y]=1;
                if (dfs(grid, visits, x-1, y)){return true;}
                visits[x-1][y]=0;
            }
            if (y+1<col&&visits[x][y+1]==0&&(grid[x][y+1]==1||grid[x][y+1]==3||grid[x][y+1]==5)){
                visits[x][y+1]=1;
                if (dfs(grid, visits, x, y+1)){return true;}
                visits[x][y+1]=0;
            }           
        }
        return false;
    }
    
    
    bool hasValidPath(vector<vector<int>>& grid) {
        int row = grid.size();
        int col = grid[0].size();
        vector<int> temp(col, 0);
        vector<vector<int>> visits(row, temp);
        visits[0][0]=1;
        return dfs(grid, visits, 0, 0);
        
    }
};