题解 | 三角形最小路径和

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param triangle int整型二维数组 
# @return int整型
#
class Solution:
    def minTrace(self , triangle: List[List[int]]) -> int:
        # write code here
        # dp[i][j]表示到达i，j时最短路径和
        n = len(triangle)
        dp = [[0]*(i) for i in range(1,n+1)]
        for i in range(n):
            for j in range(i+1):
                if i == j == 0:
                    dp[i][j] = triangle[i][j]
                elif i == j:
                    dp[i][j] = dp[i-1][j-1]+triangle[i][j]
                elif j==0:
                    dp[i][j] = dp[i-1][j]+triangle[i][j]
                else:
                    dp[i][j] = min(dp[i-1][j-1],dp[i-1][j])+triangle[i][j]
        
        return min(dp[-1])