问题描述:
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).
分析
一开始想着从上到下,结果卡住了,后来才意识到,这道题的关键是从下到上。每一个位置,都有左相邻和右相邻两个选择,要取二者中小的那个。
代码
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
int row=triangle.size();
int col=triangle[0].size();
for(int i=row-2;i>=0;i--)
{
for(int j=0;j<triangle[i].size();j++)
{
triangle[i][j]+=min(triangle[i+1][j],triangle[i+1][j+1]);
}
}
return triangle[0][0];
}
};