LeetCode 64. Minimum Path Sum 时间复杂度(O(n^2))

ziyue246

于 2019-05-22 10:47:43 发布

阅读量137

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ziyue246/article/details/90439448

LeetCode 专栏收录该内容

112 篇文章

订阅专栏

时间复杂度(O(n^2))，思想：动态规划

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