题解 | #矩阵的最小路径和#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param matrix int整型二维数组 the matrix
# @return int整型
#
class Solution:
    def minPathSum(self , matrix: List[List[int]]) -> int:
        n = len(matrix)
        m = len(matrix[0])
        dp = matrix
        for i in range(1,m):
            dp[0][i] += dp[0][i-1]
        for i in range(1,n):
            dp[i][0] += dp[i-1][0]
        for i in range(n-1):
            for j in range(m-1):
                dp[i+1][j+1] = min(dp[i+1][j],dp[i][j+1])+matrix[i+1][j+1]
        return dp[n-1][m-1]