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

求三角形最小路径。基础动态规划题。

没有开辟新的空间，直接在原二维数组上改动，方程为：

D[i][0] = D[i][0] + D[i - 1][0];

D[i][i] = D[i][i] + D[i - 1][i - 1];

D[i][j] = D[i][j] + min(D[i - 1][j - 1] , D[i - 1][j]);

代码：

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