120. 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.

从第二层开始，每层的各个数加上上一层与它相邻的两个数中最小的那个（第一个、最后一个直接加上上一层的第一个、最后一个），更新之，这样就能得到到这个点得到的最小的和。以此类推。返回更新之后最后一层的最小值。

代码：

class Solution {
public:
   int minimumTotal(vector<vector<int> >& triangle) 
   {
    int n=triangle.size();
    int res=triangle[0][0];
    for(int i=1;i<n;i++)
    {
        triangle[i][0]+=triangle[i-1][0];int j;
        if(i==n-1) res=triangle[i][0];
        for(j=1;j<triangle[i].size()-1;j++)
        {
            int Min=min(triangle[i-1][j-1],triangle[i-1][j]);
            triangle[i][j]+=Min;
            if(i==n-1) res=min(res,triangle[i][j]);
        }
        triangle[i][j]+=triangle[i-1][j-1];
        if(i==n-1) res=min(res,triangle[i][j]);
    }    
    return res;
   }
};

讨论上最多投票的代码：

int minimumTotal(vector<vector<int> > &triangle) {
    int n = triangle.size();
    vector<int> minlen(triangle.back());
    for (int layer = n-2; layer >= 0; layer--) // For each layer
    {
        for (int i = 0; i <= layer; i++) // Check its every 'node'
        {
            // Find the lesser of its two children, and sum the current value in the triangle with it.
            minlen[i] = min(minlen[i], minlen[i+1]) + triangle[layer][i]; 
        }
    }
    return minlen[0];
}