给定一个包含非负整数的 m x n 网格,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
示例:
输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-path-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路: 用dp[i][j]表示走到第(i,j)步的计算结果。
由题可知,每次只能向下或者向右移动一步,即从当前单元格只能从(i-1, j)或(i, j-1)走到。故有如下几种情况:
(1)原点时刻,即当ij0时,dp[i][j] = grid[i][j]
(2)当在矩阵上边界时,即当i0,j != 0时,dp[i][j]=grid[i][j-1]+grid[i][j]
(3)当在矩阵左边界时,即当j0,i !=0时,dp[i][j]=grid[i-1][j]+grid[i][j]
(4)当不在矩阵边界的时候,即i!=0,j!=0时,dp[i][j]=min(grid[i-1][j], grid[i][j-1])+grid[i][j]
实现代码如下:
class Solution(object):
def minPathSum(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
return self.dynamic(grid)
def dynamic(self, grid):
m = len(grid)
for i in range(0, m):
n = len(grid[i])
for j in range(0, n):
if i == j == 0:
continue
elif i == 0:
grid[i][j] = grid[i][j - 1] + grid[i][j]
elif j == 0:
grid[i][j] = grid[i - 1][j] + grid[i][j]
else:
grid[i][j] = min(grid[i - 1][j], grid[i][j - 1] ) + grid[i][j]
return grid[-1][-1]