Unique Paths II

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
            
        int table[m][n];
        int path[m][n];
        
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                table[i][j] = obstacleGrid[i][j];
            }
        }
        
        if(table[0][0] == 1)
            path[0][0] = 0;
        else 
            path[0][0] = 1;
        
        if(table[m-1][n-1] == 1)
            return 0;
        
        for(int i=1;i<m;i++)
        {
            if(table[i][0] == 1 || path[i-1][0] == 0)
            {
                path[i][0] = 0;
            }
            else
                path[i][0] = 1;
            
        }
        
        for(int j=1;j<n;j++)
        {
            if(table[0][j] == 1 || path[0][j-1] == 0)
            {
                path[0][j] = 0;
            }
            else
                path[0][j] = 1;
            
        }
        
        for(int i=1;i<m;i++)
            for(int j=1;j<n;j++)
            {
                if(table[i][j-1] == 1 && table[i-1][j] == 1)
                {
                    path[i][j] = 0;
                    table[i][j] = 1;
                }
                else if(table[i][j-1] == 1 && table[i-1][j] == 0)
                {
                    path[i][j] = path[i-1][j];
                }
                else if(table[i][j-1] == 0 && table[i-1][j] == 1)
                {
                    path[i][j] = path[i][j-1];
                }
                else
                    path[i][j] = path[i][j-1] + path[i-1][j];
                
            }
        
        return path[m-1][n-1];
        
        
        
    }
};

核心是如果path[i][j]的左边是障碍，则path[i][j] = path[i-1][j]  如果path[i][j]的上面是障碍，则path[i][j] = path[i][j-1] 如果path[i][j]左边和上边都是障碍，则该点不可到达，置为0，同时在地图上把该点置为1，即该点也是障碍。然后就可以一次做了，最左边和最上边如果其中有一个是障碍，则至此之后的都是不可到达的点，全部置为障碍