python leetcode 64. Minimum Path Sum

最新推荐文章于 2024-09-14 19:55:48 发布

Neekity

最新推荐文章于 2024-09-14 19:55:48 发布

阅读量502

点赞数

分类专栏： leetcode python 文章标签： python leetcode

本文链接：https://blog.csdn.net/Neekity/article/details/84925024

版权

python 同时被 2 个专栏收录

263 篇文章 0 订阅

订阅专栏

leetcode

221 篇文章 2 订阅

订阅专栏

与Unique Paths II类似

class Solution(object):
    def minPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        m = len(grid)
        if m == 0 :
            return 0 
        n = len(grid[0])
        dp=[[0 for i in range(n)] for j in range(m)]
        dp[0][0] = grid[0][0]
        for i in range(1,m):
            dp[i][0] = dp[i-1][0] + grid[i][0]
        for j in range(1,n):
            dp[0][j] = dp[0][j-1] + grid[0][j]
        for i in range(1,m):
            for j in range(1,n):
                dp[i][j] = min(dp[i-1][j],dp[i][j-1])+grid[i][j]
        return dp[m-1][n-1]