LeetCode-64 Minimum Path Sum

Description

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.

Submissions

解题思路与前两题机器人从左上走到右下一致。只不过需要将方格中数字累加，最后返回路径最小值即可。首先遍历二维数组，从左上开始，因为只可以向右或向下移动，因此当在第一行或第一列时，路径只需要加上前面一个点即可。而当在其他位置，则需要判断上面和左面路径大小，选择较小的数累加更新即可。最后遍历更新完成返回数组最后一个元素即为路径最小和。

实现代码如下：

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