leetcode刷题python之最小路径和

最新推荐文章于 2022-03-02 18:12:19 发布

leileii

最新推荐文章于 2022-03-02 18:12:19 发布

阅读量241

点赞数

分类专栏： leetcode_python

本文链接：https://blog.csdn.net/leileii/article/details/102785154

版权

leetcode_python 专栏收录该内容

106 篇文章 0 订阅

订阅专栏

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        n = len(grid)
        m = len(grid[0])
        for i in range(1, m):
            grid[0][i] += grid[0][i - 1]    
        for j in range(1, n):
            grid[j][0] += grid[j - 1][0]
        for i in range(1, m):
            for j in range(1, n):
                grid[j][i] += min(grid[j - 1][i], grid[j][i - 1])
        # print(grid)
        return grid[n - 1][m - 1]