题解 | 三角形最小路径和

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