python leetcode 62. Unique Paths 63. Unique Paths II

最新推荐文章于 2021-04-04 20:42:15 发布

Neekity

最新推荐文章于 2021-04-04 20:42:15 发布

阅读量624

点赞数

分类专栏： python leetcode 文章标签： python leetcode

本文链接：https://blog.csdn.net/Neekity/article/details/84919441

版权

python 同时被 2 个专栏收录

263 篇文章 0 订阅

订阅专栏

leetcode

221 篇文章 2 订阅

订阅专栏

每天限定发10篇，有些类似题目就发一起了

62. Unique Paths典型的DP题目，这一刻的路径步数与上一时刻的路径步数相关。

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

63. Unique Paths II 价格判断即可

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