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.
Subscribe to see which companies asked this question.
动态规划
开创一个数组,sum[i][j]表示triangle[i][j]开始的网上的最小和;
坑:c++里面 a = b?c:d 不能再有其他表达式,比如 a=e+ b?c:d不对!
代码如下:
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
int size = triangle.size();
if (size == 0)
return 0;
int sum[size][size] = {0};
sum[0][0] = triangle[0][0];
for (int i = 1 ; i < size ;i ++)
{
for (int j = 0 ; j <= i ; j ++)
{
if (j == 0)
sum[i][j] = triangle[i][j] + sum[i-1][0];
else if (j == i)
sum[i][j] = triangle[i][j] + sum[i-1][i-1];
else
{
sum[i][j] = (sum[i-1][j] < sum[i-1][j-1])?sum[i-1][j]:sum[i-1][j-1];
sum[i][j] += triangle[i][j];
//cout << sum[i-1][j] << " " << sum[i-1][j-1] << " " << triangle[i][j] << " "<<sum[i][j] << endl;
}
}
}
int rel = sum[size-1][0];
for (int i = 0 ; i < size ; i ++)
{
if(rel > sum[size-1][i])
rel = sum[size-1][i];
}
return rel;
}
};
题目中说最好能够用o(n)空间复杂度,网上找到解法:
我们不妨反过来想一下,先求解子问题,然后再解决父问题。即,从下往上求解最小路径和。我们可以发现如下规律,当我们求解minimum[i][j]时,我们会用到minimum[i+1][j]和minimum[i+1][j+1],但是当求解完所有minimum[i]之后minimum[i+1]就没有用处了。既然如此,我们是否可以复用同一个空间来存储minimum的值呢?答案是可以的。进一步观察发现,存储最后一行的每个数字的最小路径和需要n个空间>,因此至少我们需要n个空间,这也是题目里给出O(n)的空间复杂度的原因;之后存储倒数第二行时,我们只需要前面的n-1个空间……以此类推,第一行只需要一个空间来存储最小路径和,这也正是我们要求解的结果。
http://lib.csdn.net/article/datastructure/16222