[leetcode]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.

如果不是看到note也不会想到，其实O(1)的space就可以了

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(triangle.empty()) return 0;
        int N = triangle.size();
        
        for(int i = 1; i < N; i++){
            for(int j = 0; j < N; j++){
                if(i < j) continue;
                
                if(j == 0){
                    triangle[i][j] = triangle[i-1][j] + triangle[i][j];
                }else if(j == i){
                    triangle[i][j] = triangle[i-1][j-1] + triangle[i][j];
                }else{
                    triangle[i][j] = min(triangle[i-1][j-1], triangle[i-1][j]) + triangle[i][j];
                }
                
            }
        }
        
        int result = triangle[N-1][0];
        for(int j = 1; j < N; j++){
            result = min(result, triangle[N-1][j]);
            
        }
        return result;
        
        
        
    }
};