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

class Solution:
    def minPathSum(self , matrix: List[List[int]]) -> int:
        # write code here
        dp = [[0]*len(matrix[0]) for i in range(len(matrix))]

		# 初始状态
        dp[0][0] = matrix[0][0]
		
		# 最左边这一列
        for i in range(1, len(matrix)):
            dp[i][0] = dp[i-1][0] + matrix[i][0]

		# 最上面这一行
        for j in range(1, len(matrix[0])):
            dp[0][j] += dp[0][j-1] + matrix[0][j]
        
		# 其他位置
        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]

        return dp[-1][-1]