63. 不同路径 II 64. 最小路径和【leetcode】

gogslow

已于 2022-08-19 17:13:50 修改

阅读量268

点赞数

文章标签： leetcode 算法数据结构

于 2022-08-19 16:58:04 首次发布

本文链接：https://blog.csdn.net/gogslow/article/details/126428203

版权

63原题地址：力扣

动态规划：f[i,j] = f[i-1,j]+f[i,j-1]

'''
f[i,j] = f[i-1,j]+f[i,j-1]
遇到障碍物就不更新f
要把左边界和上边界的位置初始化
'''


class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])
        f = [[0] * n for _ in range(m)] # m行n列
        for i in range(m):
            if obstacleGrid[i][0] == 1:
                break;
            f[i][0] = 1
        for i in range(n):
            if obstacleGrid[0][i] == 1:
                break;
            f[0][i] = 1
        for i in range(1, m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 0:
                    f[i][j] = f[i][j - 1] + f[i - 1][j]
        return f[m - 1][n - 1]

64原题地址：力扣

跟63差不多

'''
f[i,j] = min(f[i-1,j],f[i,j-1])+grid[i,j]
'''


class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        m = len(grid)
        n = len(grid[0])
        f = [[0] * n for _ in range(m)] # m行n列
        add = 0 # 累加
        add2 = 0
        for i in range(m):
            add = add + grid[i][0]
            f[i][0] = add
        for i in range(n):
            add2 = add2 + grid[0][i]
            f[0][i] = add2
        for i in range(1, m):
            for j in range(1, n):
                f[i][j] = min(f[i - 1][j], f[i][j - 1]) + grid[i][j]
        return f[m - 1][n - 1]