Triangle DP求最大和

最新推荐文章于 2020-07-31 23:07:43 发布

匿名侠士

最新推荐文章于 2020-07-31 23:07:43 发布

阅读量529

点赞数

分类专栏： LeetCode OJ ACM 精选文章标签： leetcode oj

本文链接：https://blog.csdn.net/u012605629/article/details/45564581

版权

ACM 精选同时被 2 个专栏收录

295 篇文章 0 订阅

订阅专栏

LeetCode OJ

199 篇文章 0 订阅

订阅专栏

Triangle

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).

Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        
        int n=triangle.size();
        vector<int> dp(n);
        for(int i=0;i<n;i++)
            dp[i]=triangle[n-1][i];
        for(int i=n-2;i>=0;i--)
        {
            for(int j=0;j<=i;j++)
            {
                dp[j]=triangle[i][j]+min(dp[j],dp[j+1]);
            }
        }
        return dp[0];
    }
};