Leetocde 120. Triangle

class Solution {
public:
    
	int minimumTotal(vector<vector<int>>& triangle)
	{
		//从下向上加
		vector<int> minans(triangle.back());
		for (int layer = triangle.size() - 2; layer >= 0; layer--)//layer层 
		{
			for (int i = 0; i <= layer; i++) 
			{
				minans[i] = min(minans[i], minans[i + 1])+triangle[layer][i];
			}
		}
		return minans[0];
	}
    
   

};

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