描述
给定一个 n * m 的矩阵 a,从左上角开始每次只能向右或者向下走,最后到达右下角的位置,路径上所有的数字累加起来就是路径和,输出所有的路径中最小的路径和。
示例1
输入:
[[1,3,5,9],[8,1,3,4],[5,0,6,1],[8,8,4,0]]
复制返回值:
12
复制
备注:
1 \leq n,m \leq 20001≤n,m≤2000
1 \leq arr_{i,j} \leq 1001≤arri,j≤100
#
#
# @param matrix int整型二维数组 the matrix
# @return int整型
#
class Solution:
def minPathSum(self , matrix ):
dp = [[0 for i in range(len(matrix[0]))] for j in range(len(matrix))]
summ = 0
for i in range(len(matrix)):
summ += matrix[i][0]
dp[i][0] = summ
summ = 0
for i in range(len(matrix[0])):
summ += matrix[0][i]
dp[0][i] = summ
for i in range(1, len(matrix)):
for j in range(1, len(matrix[0])):
dp[i][j] = min(dp[i-1][j] , dp[i][j-1]) + matrix[i][j]
print(dp)
return dp[len(matrix)-1][len(matrix[0])-1]
# write code here
动规
递推式:
dp[i][j] = min{dp[i-1][j], dp[i][j-1]} + matrix[i][j]