Leetcode 120

最新推荐文章于 2025-08-05 16:42:55 发布

今天不标数据的小wu

最新推荐文章于 2025-08-05 16:42:55 发布

阅读量238

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/qq_42316533/article/details/121929731

在这里插入图片描述
自顶向下的动态规划

class Solution:
    def minimumTotal(self, triangle: List[List[int]]) -> int:
        n = len(triangle)
        f = [[0]*len(triangle[-1]) for i in range(n)]
        f[0][0] = triangle[0][0]
        for i in range(1, n):
            f[i][0] = f[i-1][0] + triangle[i][0]
            for j in range(1, i):
                f[i][j] = min(f[i-1][j-1], f[i-1][j]) + triangle[i][j]
            f[i][i] = f[i-1][i-1] + triangle[i][i]
        return min(f[-1])

自底向上的动态规划

class Solution:
    def minimumTotal(self, triangle: List[List[int]]) -> int:
        n = len(triangle)
        for i in range(n-2, -1, -1):
            for j in range(len(triangle[i])):
                triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1])
        return triangle[0][0]