leetcode：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.

给定一个三角形，查找一条最短路径。这题最容易想到的是遍历每一条路径，然后进行比较，留下最短路径。不过这种方法很费时，而用动态规划，就只需要O（n）的时间。

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        int line = triangle.size();
        for(int row=line-2; row>=0; row--){
            for(int col=0; col<triangle[row].size(); col++){
                triangle[row][col]+= min(triangle[row+1][col],triangle[row+1][col+1]);
            }
        }
        return triangle[0][0];
    }
private:
    int min(int a, int b){
        return a>b?b:a;
    }
};