题目描述
经典必刷编程题库——三角形
给出一个三角形,计算从三角形顶部到底部的最小路径和,每一步都可以移动到下面一行相邻的数字。
例如,给出的三角形如下:[[20],[30,40],[60,50,70],[40,10,80,30]]
最小的从顶部到底部的路径和是20 + 30 + 50 + 10 = 110
class Solution
{
public:
int minimumTotal(vector<vector<int>>& triangle)
{
if(triangle.size() == 0)
return 0;
int row = triangle.size();
int col = row;
vector<vector<int>> minSum(triangle);
for(int i = 1; i < row; i++)
{
for(int j = 0; j <= i; j++)
{
if(j == 0)
minSum[i][j] = minSum[i-1][j] + triangle[i][j];
else if(j == i)
minSum[i][j] = minSum[i-1][j-1] + triangle[i][j];
else
minSum[i][j] = min(minSum[i-1][j-1], minSum[i-1][j])+triangle[i][j];
}
}
int ret = minSum[row-1][0];
for(int j = 1; j < row; j++)
{
ret = min(ret, minSum[row - 1][j]);
}
return ret;
}
};
方法2:从最后一步往前推
class Solution
{
public:
int minimumTotal(vector<vector<int> > &triangle)
{
if(triangle.size() == 0)
return 0;
int row = triangle.size();
int col = row;
vector<vector<int>> minSum(triangle);
for(int i = row - 2; i >= 0; i--)
{
for(int j = 0; j <= i; j++)
{
minSum[i][j] = min(minSum[i+1][j], minSum[i+1][j+1])+triangle[i][j];
}
}
return minSum[0][0];
}
};