[LeetCode] 64. Minimum Path Sum

题目内容

https://leetcode-cn.com/problems/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.

给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。

说明：每次只能向下或者向右移动一步。

---

题目思路

这道题目依旧是动态规划。先把第一行和第一列的情况处理（叠加前项即可），然后对于抛出上侧第一行和左侧第一列的矩阵来说，它本身最小的路径在于和上侧以及左侧中选择更小的那个。所以通过这种方式不断迭代，最终得到最后一个的最小值。

---

程序代码

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