[LeetCode Python3] 63. Unique Paths II

SincX

于 2020-10-16 19:55:43 发布

阅读量88

点赞数

分类专栏： LeetCode每日一题文章标签：独特路径障碍物网格动态规划算法

本文链接：https://blog.csdn.net/xvrixingkong/article/details/109123964

版权

LeetCode每日一题专栏收录该内容

172 篇文章 0 订阅

订阅专栏

63. Unique Paths II

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        if not obstacleGrid or not obstacleGrid[0]:
            return 0
        if obstacleGrid[0][0] == 1:
            return 0
        m, n = len(obstacleGrid), len(obstacleGrid[0])
        flag = True
        for i in range(n):
            if obstacleGrid[0][i] == 1:
                flag = False
            if flag:
                obstacleGrid[0][i] = 1
            else:
                obstacleGrid[0][i] = 0
        flag = True
        for i in range(1,m):
            if obstacleGrid[i][0] == 1:
                flag = False
            if flag:
                obstacleGrid[i][0] = 1
            else:
                obstacleGrid[i][0] = 0
        for i in range(1, m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 1:
                    obstacleGrid[i][j] = 0
                else:
                    obstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1]
        return obstacleGrid[-1][-1]