leetcode64. 最小路径和

https://leetcode-cn.com/problems/minimum-path-sum/

给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。
说明：每次只能向下或者向右移动一步。
示例:
输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。

对于最上边和最左边，到达该位置最小和为这一行或这一列之前所有位置数之和；其他地方，到达该位置最小和为上面一个或左边一个中的较小的：

class Solution(object):
    def minPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        x, y = len(grid), len(grid[0])
        for i in range(x):
            for j in range(y):
                if i == 0 and j != 0:
                    grid[i][j] = grid[i][j-1] + grid[i][j]
                elif i != 0 and j == 0:
                    grid[i][j] = grid[i-1][j] + grid[i][j]
                elif i !=0 and j != 0:
                    grid[i][j] = min(grid[i-1][j], grid[i][j-1]) + grid[i][j]
                else:
                    pass
        return grid[x-1][y-1]

借助一个list，一行一行求解：

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