LeetCode —— Triangle

最新推荐文章于 2024-01-06 17:59:43 发布

江枫abalone

最新推荐文章于 2024-01-06 17:59:43 发布

阅读量526

点赞数

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

本文链接：https://blog.csdn.net/niaokedaoren/article/details/8829267

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

链接：http://leetcode.com/onlinejudge#question_120

原题：

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.

思路：一道dp题目，蛮简单的

除了边界点，中间点都有两条路可以走：

1）左上方下来

2）右上方下来

然后取一个小值就可以了。空间复杂度为O（N），先覆盖右边界点就可以了。

代码：

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (triangle.size() == 0)
            return 0;
        vector<int> total(triangle.size());
        total[0] = triangle[0][0];
        
        for (int n=1; n<triangle.size(); n++) {
            total[n] = total[n-1] + triangle[n][n];
            for (int i=n-1; i>0; i--) {
                int topRight = total[i] + triangle[n][i];
                int topLeft = total[i-1] + triangle[n][i];
                total[i] = topRight < topLeft ? topRight : topLeft;
            }
            total[0] += triangle[n][0];
        }
        
        int min = total[0];
        for (int i=1; i<total.size(); i++)
            if (min > total[i])
                min = total[i];
        return min;
    }
};