[LeetCode]Unique Paths II@python

最新推荐文章于 2024-09-19 06:03:14 发布

benjamin_sunny_li

最新推荐文章于 2024-09-19 06:03:14 发布

阅读量137

点赞数

文章标签： leetcode dp

本文链接：https://blog.csdn.net/weixin_38111819/article/details/79180872

版权

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.

思路：这个题和上一题的区别在于，如果有障碍，那么他所在的这一行和这一列都走不通了，所以用乘0把路封死。注意区别对待第一行和第一列。

class Solution(object):
    def uniquePathsWithObstacles(self, obstacleGrid):
        """
        :type obstacleGrid: List[List[int]]
        :rtype: int
        """
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])
        
        obstacleGrid[0][0] = 1-obstacleGrid[0][0]
        for i in range(1,m):
            obstacleGrid[i][0] = (1 - obstacleGrid[i][0])*obstacleGrid[i-1][0]
        for j in range(1,n):
            obstacleGrid[0][j] = (1 - obstacleGrid[0][j])*obstacleGrid[0][j-1]
            
        for i in range(1,m):
            for j in range(1,n):
                obstacleGrid[i][j] = (obstacleGrid[i-1][j]+obstacleGrid[i][j-1])*(1-obstacleGrid[i][j])
        return obstacleGrid[-1][-1]