Triangle
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.
解题思路:动态规划,自底向上,将上面的数组看成一个左旋90度的表格,当前元素值为 min(a[i][j] + a[i][j + 1]), a[i + 1][j])
class Solution {
public:
int minimumTotal(vector<vector<int> > &tg) {
// Note: The Solution object is instantiated only once and is reused by each test case.
//triangle
size_t vvsize = tg.size();
long int i = vvsize - 1;
long int j;
for(; i > 0; i--){
for(j = 0; j < tg[i].size() - 1; j++){
int tmp = tg[i][j] > tg[i][j + 1] ? tg[i][j+1] : tg[i][j];
tg[i-1][j] += tmp;
}
}
return tg[0][0];
}
};