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.
自顶向下做的,以前做过。关键min_paths[i][j] = min(min_paths[i-1][j-1],min_paths[i-1][j])+triangle[i][j];
然后是处理边界,以前感觉处理不是很好,此处一次AC。发现终于提高了不少。(no bug ,one pass 终极目标。。。)
此题若采用自底向上,那就容易多了,没有边界处理!详见Triangle
int minimumTotal(vector<vector<int> > &triangle)
{
vector<vector<int>> min_paths(triangle.size(),vector<int>(triangle.size()));
min_paths[0][0] = triangle[0][0];
for (int i = 1; i < triangle.size();i++)
{
min_paths[i][0] = min_paths[i-1][0] + triangle[i][0];//处理第0列的边界
min_paths[i][i] = min_paths[i-1][i-1] + triangle[i][i];//处理对角线边界
}
for (int i = 1;i < triangle.size();i++)
{
for (int j = 1;j < i;j++)
{
min_paths[i][j] = min(min_paths[i-1][j-1],min_paths[i-1][j])+triangle[i][j];
}
}
//寻找最小值
int min_val = min_paths[triangle.size()-1][0];
for (int i = 1; i < triangle.size();i++)
{
min_val = min_val < min_paths[triangle.size()-1][i]?min_val:min_paths[triangle.size()-1][i];
}
return min_val;
}