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.
解题代码
/** 计算三角从上至小最小路径和 */
int minimumTotal(vector<vector<int> > &triangle) {
// 初始状态,从最后一行开始向上计算
vector<int> minNums = triangle[triangle.size() - 1];
//从倒数第二行开始递推,每层计算完都会少一个数
for (int i = triangle.size() - 2; i > -1; --i)
for (int j = 0; j <= i; ++j)
minNums[j] = (minNums[j] < minNums[j + 1] ? minNums[j] : minNums[j + 1])
+ triangle[i][j];
return minNums[0];
}