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, wheren is the total number of rows in the triangle.

英语误人吖……一开始没看到adjacent……还在想为什么要用O（n）的额外空间，后来看别人的答案才发祥原来要相邻……

DP问题，自底向上比较简洁。状态转移方程为S[i,j] = triangle[i, j] + min( S[i+1, j] , S[i+1, j+1] ).

这里直接取triangle的最后一行，然后不断对前面的部分进行更新，最后mini[0][0]即为所求。

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

二刷

对自己感到很满意，没有用额外的空间哟。

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