LeetCode:64. Minimum Path Sum

最新推荐文章于 2019-07-18 20:50:03 发布

XP-Code

最新推荐文章于 2019-07-18 20:50:03 发布

阅读量106

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Wisimer/article/details/92839491

版权

LeetCode 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

LeetCode:64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

这题就是62. Unique Paths每一个格子加上权重之后的考法，就是求左上角到右下角那种走法使得走过的格子权重之和最小。

思路：动态规划

设要求到达(i,j)处格子的路径最小权重之和为res(i,j)，且(i,j)处的权重为grid(i,j)，那么：

res(i,j) = min(res(i-1,j),res(i,j-1))+grid(i,j)

同时注意下第一行和第一列两种特殊情况即可。

Python代码实现

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