LeetCode 63. Unique Paths II

Queen、

于 2017-09-17 21:59:30 发布

阅读量240

点赞数

分类专栏： Arr-LeetCode LeetCode LeetCode题解

本文链接：https://blog.csdn.net/Queue_notes/article/details/78013949

版权

LeetCode 同时被 3 个专栏收录

29 篇文章 0 订阅

订阅专栏

LeetCode题解

24 篇文章 1 订阅

订阅专栏

Arr-LeetCode

22 篇文章 0 订阅

订阅专栏

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.

有障碍物问题，不可达dp[i][j]=0,其余不变

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