leetcode-64. 最小路径和

题目

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

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

示例:

输入:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。

解题思路

简单dp，用dp[i][j]代表走到grid[i][j]时的最小路径长度，转移方程是：dp[i][j] = grid[i][j] + min(dp[i - 1][j], dp[i][j - 1])。时间和空间复杂度都是$o(mn)$

可以缩减空间复杂度到$o(len(grid[0]))$

代码

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        dp = [[grid[0][0]] * len(grid[0]) for _ in range(len(grid))]
        # init
        for row in range(1, len(grid)):
            dp[row][0] = dp[row - 1][0] + grid[row][0]
        for col in range(1, len(grid[0])):
            dp[0][col] = dp[0][col - 1] + grid[0][col]
        # dp
        for row in range(1, len(grid)):
            for col in range(1, len(grid[0])):
                dp[row][col] = grid[row][col] + min(dp[row - 1][col], dp[row][col - 1])
        return dp[-1][-1]

缩减空间版：

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        big_num = 1000000007
        dp = [grid[0][0]] * len(grid[0])
        # init
        for col in range(1, len(grid[0])):
            dp[col] = grid[0][col] + dp[col - 1]
        # dp
        for row in range(1, len(grid)):
            for col in range(len(grid[0])):
                dp[col] = grid[row][col] + min(dp[col], dp[col - 1] if col - 1 >= 0 else big_num)
        return dp[-1]