给定一个数字三角形, 找到从顶部到底部的最小路径和. 每一步可以移动到下面一行的相邻数字上.
样例
比如, 给出下列数字三角形:
[[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
从顶到底部的最小路径和为 11 (2 + 3 + 5 + 1 = 11).
class Solution {
public:
/*
* @param triangle: a list of lists of integers
* @return: An integer, minimum path sum
*/
int minimumTotal(vector < vector < int >> &triangle) {
// write your code here
int row = triangle.size();
for (row = row - 2; row >= 0; row--) {
for (int col = 0; col <= row; col++) {
triangle[row][col] += min(triangle[row + 1][col], triangle[row + 1][col + 1]);
}
}
return triangle[0][0];
}
};
来源: http://www.bubuko.com/infodetail-2477749.html