Leetcode 64.最小路径和
1 题目描述(Leetcode题目链接)
给定一个包含非负整数的 m x n 网格,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。
2 题解
动态规划,定义
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]为到
g
r
i
d
[
i
]
[
j
]
grid[i][j]
grid[i][j]的最短路径和。状态转移方程为:
d
p
[
i
]
[
j
]
=
g
r
i
d
[
i
]
[
j
]
+
m
i
n
(
d
p
[
i
−
1
]
[
j
]
+
d
p
[
i
]
[
j
−
1
]
)
dp[i][j] = grid[i][j] + min(dp[i-1][j] + dp[i][j-1])
dp[i][j]=grid[i][j]+min(dp[i−1][j]+dp[i][j−1])
class Solution:
def minPathSum(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
dp = [([float("inf")]*(n+1)) for _ in range(m+1)]
dp[0][1] = dp[1][0] = 0
for i in range(1, m+1):
for j in range(1, n+1):
dp[i][j] = grid[i-1][j-1] + min(dp[i-1][j], dp[i][j-1])
return dp[-1][-1]
使用一维数组优化内存。
class Solution:
def minPathSum(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
s = 0
dp = [float("inf")]
for i in range(n):
s += grid[0][i]
dp.append(s)
print(dp)
for i in range(2, m+1):
for j in range(1, n+1):
dp[j] = grid[i-1][j-1] + min(dp[j-1], dp[j])
return dp[-1]