算法训练 Day39

最新推荐文章于 2024-10-15 14:48:32 发布

m0_73129924

最新推荐文章于 2024-10-15 14:48:32 发布

阅读量36

点赞数

文章标签：算法 leetcode 职场和发展 python

本文链接：https://blog.csdn.net/m0_73129924/article/details/129165838

版权

62.不同路径

解题思路：动规

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[0]*n for _ in range(m)]
        #3.初始化数组
        for x in range(m):dp[x][0] = 1
        for y in range(n):dp[0][y] = 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)]
        if (obstacleGrid[m - 1][n - 1] == 1 or obstacleGrid[0][0] == 1): return 0 #如果在起点或终点出现了障碍，直接返回0return 0
        #3.初始化数组
        for x in range(m):
            if obstacleGrid[x][0] == 1:
                break
            dp[x][0] = 1

        for y in range(n):
            if obstacleGrid[0][y] == 1:
                break
            dp[0][y] = 1
        
        #4.遍历顺序(从左到右，从上到下)
        for i in range(1,m):
            for j in range(1,n):
                if obstacleGrid[i][j] != 1:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[m-1][n-1]