120. Triangle

最新推荐文章于 2024-01-20 11:36:00 发布

raorang

最新推荐文章于 2024-01-20 11:36:00 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/raorang/article/details/72190094

本文介绍了一种求解三角形结构中从顶点到底边的最小路径和的方法，使用了动态规划的思想，并实现了O(n)的空间复杂度优化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description:

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.

Solutions:

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