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.
分析:
设有一个和上图三角形一样大小的表,表里的每个位置表示走到当前路径所花费的最小代价。有递推式子:
dp[i][j] = dp[i][j]+min{ dp[i-1][j], dp[i-1][j-1] },
意思是走到当前位置的最小花费等于 当前位置路径的开销+上一层能选择当前路径的位置里开销最小的那个。
代码实现的时候有个trick,可以只使用o(n)(n指的是三角形的行数)的空间,申请一个int[n],然后从后往前更新数组,这样就可以节省空间。
代码:
class Solution {
public:
int min(int a, int b)
{
return a<=b?a:b;
}
int minimumTotal(vector<vector<int>>& triangle) {
vector<int>res(triangle.size(),0);
for(int i=0;i<triangle.size();++i)
{
for(int j=triangle[i].size()-1;j>=0;--j)
{
int l, r;
l=j-1>=0?j-1:0;
r=j<triangle[i-1].size()?j:triangle[i-1].size()-1;
res[j]=min(res[l], res[r])+triangle[i][j];
}
}
int min = res[0];
for(int i=1;i<res.size();++i)
if(min>res[i])
min=res[i];
return min;
}
};