【leetcode】120. Triangle

问题是求一个直角三角形从上到下的和最小的路径，要求每一行的路径要么是上一行对应列而来，要么是上一行对应列-1即斜对角线而来。问题描述：

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.

方法1：自上而下，动态规划算法，op[i][j] = min(op[i - 1][j], op[i - 1][j - 1]); 需要注意到的是op[0][0] = triangle[0][0];

代码为：

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        int op[1000][1000];
        op[0][0] = triangle[0][0];
        for(int i = 1; i < triangle.size(); i++)
        {
            op[i][0] = triangle[i][0] + op[i - 1][0];
        }
        for(int i = 1; i < triangle.size(); i++)
        {
            int j;
            for(j = 1; j < triangle[i].size() - 1; j++)
            {
                op[i][j] = min(op[i - 1][j] + triangle[i][j], op[i - 1][j - 1] +triangle[i][j]);
            }
            op[i][j] = op[i - 1][j - 1] + triangle[i][j];
        }
        int miniSum = op[triangle.size() - 1][0];
        for(int j = 1; j < triangle[triangle.size() - 1].size(); j++)
            if(miniSum > op[triangle.size() - 1][j])
               miniSum = op[triangle.size() - 1][j];
        return miniSum;
    }
};

 方法2：显然上面的方法要考虑的问题很多，但是便于理解，当然也可以从下到上构造最小值路径：

op[i][j] = min(op[ i + 1][j] + triangle[i][j], op[i + 1][j + 1] + triangle[i][j]);

更可以简化为 trianlge[i][j] += min(triangle[i + 1][ j], trianlge[i + 1][j + 1]); 最后输出triangle[0][0]即可。

代码为：

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++) //第i行共i个数字
                triangle[i][j] += min(triangle[i + 1][j], triangle[i + 1][j + 1]);
        return triangle[0][0];
    }
};