Leetoode之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

题意：求最小路径，不过要求每次只能在下一行相邻位置移动，如果没有这条件，拿这题就简单了，多了这个条件就比较麻烦了，但这个不是和dp很像吗？我用的是dp的写法，从后往前每次取相邻两个中最小的和上一行对应相加，最后到达顶端刚好剩一个

ac代码：

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])+triangle[i][j];
            }
        }
        return triangle[0][0];        //返回最顶上那个数
    }
};