给定一个 n * m 的矩阵 a,从左上角开始每次只能向右或者向下走,最后到达右下角的位置,路径上所有的数字累加起来就是路径和,输出所有的路径中最小的路径和。
[输入]
[[1,3,5,9],[8,1,3,4],[5,0,6,1],[8,8,4,0]]
[输出]
12
def minPathSum(matrix):
if not matrix: # 如果矩阵为空,返回0
return 0
n = len(matrix)
m = len(matrix[0])
dp = [[0 for _ in range(m)] for _ in range(n)]
dp[0][0] = matrix[0][0]
for i in range(1,n):
dp[i][0] = dp[i-1][0]+ matrix[i][0]
for j in range(1,m):
dp[0][j] = dp[0][j-1] + matrix[0][j]
for i in range(1,n):
for j in range(1,m):
dp[i][j] = min(dp[i-1][j],dp[i][j-1])\
+ matrix[i][j]
return dp[n-1][m-1]
matrix = [[1,3,5,9],[8,1,3,4],[5,0,6,1],[8,8,4,0]]
print(minPathSum(matrix))
其实我们完全不需要建立 dpdp 矩阵浪费额外空间,直接遍历 grid[i][j]grid[i][j] 修改即可。这是因为:grid[i][j] = min(grid[i - 1][j], grid[i][j - 1]) + grid[i][j] ;原 gridgrid 矩阵元素中被覆盖为 dpdp 元素后(都处于当前遍历点的左上方),不会再被使用到。
def minPathSum(matrix):
if not matrix: # 如果矩阵为空,返回0
return 0
n = len(matrix)
m = len(matrix[0])
for i in range(0,n):
for j in range(0,m):
if i == j ==0:
continue
elif i == 0:
matrix[i][0] = matrix[i - 1][0] + matrix[i][0]
elif j == 0:
matrix[0][j] = matrix[0][j - 1] + matrix[0][j]
else:
matrix[i][j] = min(matrix[i-1][j],matrix[i][j-1]) + matrix[i][j]
return matrix[n-1][m-1]