Unique Paths II-CSDN博客

本文链接：https://blog.csdn.net/chsun_1123/article/details/51442572

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.

按行或者是列初始化dp数组的时候如果之前的为０，那么后面的也肯定是０了

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        if(obstacleGrid.empty()||obstacleGrid[0][0]==1||obstacleGrid[obstacleGrid.size()-1][obstacleGrid[0].size()-1]==1)
            return 0;
        int m=obstacleGrid.size();
        int n=obstacleGrid[0].size();
        vector<vector<int>>dp(m,vector<int>(n)); //dp数组定义
        dp[0][0]=1;
        for(int i=1;i<n;i++) //
        {
            if(obstacleGrid[0][i]==1||dp[0][i-1]==0)
                dp[0][i]=0;
            else
                dp[0][i]=1;
        }
        for(int i=1;i<m;i++)
        {
            if(obstacleGrid[i][0]==1||dp[i-1][0]==0)
                dp[i][0]=0;
            else
                dp[i][0]=1;
        }
        for(int i=1;i<m;i++)
            for(int j=1;j<n;j++)
            {
                dp[i][j]=obstacleGrid[i][j]==1?0:dp[i-1][j]+dp[i][j-1];   
            }
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                cout<<dp[i][j]<<"  ";
            }
            cout<<endl;
        }
        return dp[m-1][n-1];
    }
};