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) {
        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];
    }
};