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.
分析:
定义子问题:path[i][j]为第i行第j列(从0算起)到底部的最小路劲和
这个问题开始的时候我是从数组的顶部往下推结果,显然错了,应该反着来。
不能像这篇博客一样,http://blog.csdn.net/ebowtang/article/details/50640213
从path[i][j]开始出发,显然只能走path[i+1][j]或者path[i+1][j+1]
于是path[i][j]=min(path[i+1][j],path[i+1][j+1])+triangle[i][j];
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
if(triangle.size()==0)
return 0;
if(triangle.size()==1)//只有一行的情况,直接找最小值即可
{
int minsum=INT_MIN;
for(int i=0;i<triangle.size();i++)
if(minsum < triangle[0][i])
minsum=triangle[0][i];
return minsum;
}
/*
//申请数组,并初始化最后一行
vector< vector<int> > path(triangle.size());
for(int i=0;i<triangle.size();i++)
path[i].resize(i+1);
for(int i=0;i<triangle.size();i++)
path[triangle.size()-1][i]=triangle[triangle.size()-1][i];
*/
//等效于上面的操作
vector< vector<int> > path(triangle);
//递推
for(int i=triangle.size()-2;i>=0;i--)//从倒数第二行开始扫描
for(int j=0; j < triangle[i].size();j++)
path[i][j] = min( path[i+1][j], path[i+1][j+1])+triangle[i][j];
return path[0][0];
}
};
最后发现可以直接递推即可:
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
vector< vector<int> > path(triangle);
for(int i=triangle.size()-2;i>=0;i--)//从倒数第二行开始递推
for(int j=0; j < triangle[i].size();j++)
path[i][j] = min( path[i+1][j], path[i+1][j+1])+triangle[i][j];
return path[0][0];
}
};
联动这篇路劲和博客:
<LeetCode OJ> 64. Minimum Path Sum,博客地址,http://blog.csdn.net/ebowtang/article/details/50640213
注:本博文为EbowTang原创,后续可能继续更新本文。如果转载,请务必复制本条信息!
原文地址:http://blog.csdn.net/ebowtang/article/details/50687182
原作者博客:http://blog.csdn.net/ebowtang