代码随想录day39|62. 不同路径63. 不同路径 II

最新推荐文章于 2024-09-13 16:27:15 发布

fof920

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量155

点赞数

文章标签：算法 python leetcode

本文链接：https://blog.csdn.net/weixin_44529258/article/details/132635377

版权

62. 不同路径

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

63. 不同路径 II

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        m=len(obstacleGrid)
        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]