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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/triangle
 

思路：

1. 自底向上

2. 从倒数第2行开始更新triangle数组中的值

3. 状态转移方程：triangle[i][j] += min(triangle[i + 1][j], triangle[i + 1][j + 1]);即为该数字加上与它相邻的下一行数字中的最小值，一直进行累加，最后triangle[0][0]就是最终值

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