LeetCode 120: Triangle

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 rows = triangle.size();
        vector<int> dp(rows, 0);
        dp[0] = triangle[0][0];

        for (int i = 1; i < rows; ++i) {
            int len = triangle[i].size();
            for (int j = len - 1; j >= 0; --j) {
                if (j == len - 1) {
                    dp[j] = dp[j-1] + triangle[i][j];
                } 
                else if (j == 0) {
                    dp[j] = dp[j] + triangle[i][j];
                }
                else {
                    dp[j] = min(dp[j-1], dp[j]) + triangle[i][j];
                }
            }
        }

        return *min_element(dp.begin(), dp.end());
    }
};