【leetcode】Triangle

链接：https://oj.leetcode.com/problems/triangle/

描述：

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.

方法：

比较简单，用一个pre记录上次用的一个值，即可实现O(n)空间。

代码如下：

    int minimumTotal(vector<vector<int> > &triangle) {
    	int size = triangle.size();
    	if(size <= 0 ) return 0;
    	vector<int> sums(size, 0);
    	int pre;
    	sums[0] = triangle[0][0];
    
    	for(int i=1; i < size; ++i)
    	{
    		pre = sums[0];
    		sums[0] += triangle[i][0];
    		for(int j = 1; j < i; ++j)
    		{
    			if( pre > sums[j])
    			{
    				pre = sums[j];
    				sums[j] += triangle[i][j];
    			}else
    			{
    				int temp = sums[j];
    				sums[j] = pre + triangle[i][j];
    				pre = temp;
    			}
    		}
    		sums[i] = pre + triangle[i][i];
    	}
    
    	int result = sums[0];
    	for(int i=1; i < size; ++i )
    		if( result > sums[i])
    			result = sums[i];
    	return result;
    }