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.
典型的动态规划题目,很简单,思路写在注释中了:
/*************************************************************************************
** 思路:
** 1.题目提示说使用O(n)空间复杂度会有加分,但是,初始想法是广度优先搜索,
** 即,从上至下遍历三角数据结构,记录到每一层特定位置所获得的和,知道全部遍历完成,
** 由于对于每一层的每个位置来说都有两个选择,那么假设有n层,则空间复杂度是O(n^2)
** 2.换个角度想,其实是一个动态规划的问题,自下至上求解的话,每个小三角都是一个子问题,
** 只需记录由最底层到达第i层的第j个位置所能获得的最小值即可,因为对于其i-1层来说,要想获得
** 最小值,肯定会选择当前记录的路径所获得的最小值结果,这样,我们只需要最底层数组长度的额外空间
** 由此,由于三角结构原因,其空间复杂度正好为O(n)
*************************************************************************************/
class Solution {
public:
int minimumTotal(vector<vector<int> > &triangle) {
int size=triangle.size();
if (size==0)
{
return 0;
}
int minRel=0;
int i=triangle.size()-1;
vector <int> currentRow(triangle[i]);
i=i-1;
for (;i>=0;i--)
{
for (int j=0;j<triangle[i].size();j++)
{
currentRow[j]=currentRow[j]+triangle[i][j];
if (currentRow[j]>currentRow[j+1]+triangle[i][j])
{
currentRow[j]=currentRow[j+1]+triangle[i][j];
}
}
}
return currentRow[0];
}
};
My Submissions for Triangle
Submit Time | Status | Run Time | Language |
---|---|---|---|
3 weeks, 6 days ago | Accepted | 40 ms | cpp |
3 weeks, 6 days ago | Wrong Answer | N/A | cpp |