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.
* 
*               
**********************************************************************************/

思路：从下到上，计算倒数第二行到最后一行的路径，有了这个数据后就可以计算往上一行的距离，因此遍历到最顶。

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        if (triangle.size() == 0) return 0;

        int height = triangle.size();
        for (int i = height - 2; i >= 0; i--) {
            for (int j = 0; j <= i; j++) {
                int t1 = triangle[i + 1][j];
                int t2 = triangle[i + 1][j + 1];
                triangle[i][j] += t1 < t2 ? t1 : t2;
            }
        }
        return triangle[0][0];
    }
};