63. Unique Paths II**

最新推荐文章于 2020-07-06 10:19:42 发布

Yingying_code

最新推荐文章于 2020-07-06 10:19:42 发布

阅读量170

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/alwaystry/article/details/53493945

版权

leetcode 专栏收录该内容

261 篇文章 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.

Reference

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
    int width = obstacleGrid[0].length;
    int[] dp = new int[width];
    dp[0] = 1;
    for (int[] row : obstacleGrid) {
        for (int j = 0; j < width; j++) {
            if (row[j] == 1)
                dp[j] = 0;
            else if (j > 0)
                dp[j] += dp[j - 1];
        }
    }
    return dp[width - 1];
}

总结：没想出来，绕晕了。思路大概是对的，具体细节还需考虑