Unique Paths II

63. Unique Paths II

 

 

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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.

Note: m and n will be at most 100.

Example 1:

Input:
[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]
Output: 2
Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right

 

思路：和之前的差不多，只不过这一次对第一行，第一列都要处理，如果原始矩阵为1说明有障碍，那么这个位置及其之后都为0.
接着遍历dp，对后面f[i][j]=f[i-1][j]+f[i][j-1]，但是如果对应的矩阵[i][j]==1说明有障碍，那么直接置为0即可。

 

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        //对一行以及第一列处理
        int m=obstacleGrid.size();
        int n=obstacleGrid[0].size();
        if(m==0||n==0)
            return 0;
        vector<vector<long>>dp(m,vector<long>(n,1));
        for(int i=0;i<m;i++)
        {
            if(obstacleGrid[i][0]==1||(i-1>=0&&dp[i-1][0]==0))
                dp[i][0]=0;
            else 
                dp[i][0]=1;
            
        }
        for(int i=0;i<n;i++)
        {
            if(obstacleGrid[0][i]==1||(i-1>=0&&dp[0][i-1]==0))
                dp[0][i]=0;
            else 
                dp[0][i]=1;
            
        }
        
        //接下来遍历dp
        for(int i=1;i<m;i++)
        {
            for(int j=1;j<n;j++)
            {
                if(obstacleGrid[i][j]==0)
                    dp[i][j]=dp[i-1][j]+dp[i][j-1];
                else
                    dp[i][j]=0;
                
            }
            
        }
        return dp[m-1][n-1];
        
    }
};