120. Triangle

最新推荐文章于 2024-09-14 18:52:56 发布

yuccess

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量175

点赞数

分类专栏：动态规划算法文章标签：动态规划 leetcode

本文链接：https://blog.csdn.net/djgjmtdmjt/article/details/52940188

版权

动态规划算法专栏收录该内容

15 篇文章 0 订阅

订阅专栏

题目：

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle

[
     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]
]

The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).

代码1：

比较简单的二维动态规划问题。降维的时候保存两个数组pre和cur。初始值i从1开始要比0开始要好一些。

int minimumTotal(vector<vector<int>>& triangle) {
        int row = triangle.size();
        if(row == 1) return triangle[0][0];
        vector<int> pre(row, INT_MAX);
        vector<int> cur(row, INT_MAX);
        int ans = INT_MAX;
        pre[0] = triangle[0][0];
        for(int i = 1; i < row; i++){
            
            for(int j = 0; j <= i; j++)
            {
                
                if(j == 0) cur[j] = pre[j] + triangle[i][j];
                else if(j == i) 
                    cur[j] = pre[j - 1] + triangle[i][j];
                else{
                    
                    cur[j] = min(pre[j], pre[j - 1]) + triangle[i][j];
                }
                
            }
            pre = cur;
        }
        for(int i = 0; i < row; i++)
        ans = min(ans, cur[i]);
        return ans;
    }

代码2，

另外，如果从三角的底部开始，会简单一些，可以省去一个数组，只用保存cur就好了。代码如下

int minimumTotal(vector<vector<int> > &triangle) {
    int n = triangle.size();
    vector<int> minlen(triangle.back());
    for (int layer = n-2; layer >= 0; layer--) // For each layer
    {
        for (int i = 0; i <= layer; i++) // Check its every 'node'
        {
            // Find the lesser of its two children, and sum the current value in the triangle with it.
            minlen[i] = min(minlen[i], minlen[i+1]) + triangle[layer][i]; 
        }
    }
    return minlen[0];
}