【动态规划】三角形最小路径和

最新推荐文章于 2024-10-08 10:36:00 发布

头发凌乱的鳌拜

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量59

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/oceanicC/article/details/122843227

版权

动态规划 leetcode 算法

Leetcode 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

Leetcode:120. 三角形最小路径和 - 力扣（LeetCode） (leetcode-cn.com)

#f(m,0)=f(m-1,0)+triangle[m][0]

#f(m,n)=min(f(m-1,n),f(m-1,n-1))+triangle[m][n]

#f(m,len(triangle[n]-1))=f(m-1,len(triangle[n]-1-1)+triangle[m][len(triangle[n]-1]

代码如下：

class Solution(object):
    def minimumTotal(self, triangle):
        """
        :type triangle: List[List[int]]
        :rtype: int
        """
        #f(m,0)=f(m-1,0)+triangle[m][0]
        #f(m,n)=min(f(m-1,n),f(m-1,n-1))+triangle[m][n]
        #f(m,len(triangle[n]-1))=f(m-1,len(triangle[n]-1-1)+triangle[m][len(triangle[n]-1]
        f = [[0] * len(tr) for tr in triangle]
        f[0][0] = triangle[0][0]
        for i in range(1, len(triangle)):
            f[i][0] = f[i - 1][0] + triangle[i][0]
            for j in range(1, len(triangle[i]) - 1):
                f[i][j] = min(f[i - 1][j], f[i - 1][j - 1]) + triangle[i][j]
            f[i][len(triangle[i]) - 1] = f[i - 1][len(triangle[i]) - 2] + triangle[i][len(triangle[i]) - 1]
        return min(f[-1])