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

题目大意

在一个由数组组成的三角中找到顶到底的最短路径，即沿路元素加起来值最小。

我的解答

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        int n = triangle.size();
        vector<int> line = triangle[n-1];
//记录三角形最底层的vector
        for(int i = n-2; i >= 0; i--){
            for(int j = 0; j < triangle[i].size(); j++){
               line[j] = triangle[i][j] + min(line[j],line[j+1]);
//上一层的每个元素加上它的左右孩子中小的那一个
            }
        }
        return line[0];
    }
};