LeetCode#120. Triangle

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

miaowangbing

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

阅读量280

点赞数

分类专栏： LeetCode 文章标签： DP 动态规划 path 120. Triangle

本文链接：https://blog.csdn.net/miaowangbing/article/details/50904277

版权

LeetCode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

120. Triangle

Total Accepted: 65067 Total Submissions: 219220 Difficulty: Medium

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.

解题思路

（1）动态规划：triangle[i][j]+=min(triangle[i+1][j],triangle[i+1][j+1]);从最底层开始出发考虑，自底向上求解。

（2）时间复杂度O(n^2)

（3）空间复杂度O(1)

C++代码

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