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.

Accepted

185,608

Submissions

467,832

方法一（自己写，最后几点超时）

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void doPrecess(vector<vector<int>>& triangle, int levels, int row, int col, int& ans, int temp){
    if(row >= levels){
        if(temp < ans)
            ans = temp;
        return;
    }
    temp += triangle[row][col];
    doPrecess(triangle, levels, row + 1, col, ans, temp);
    doPrecess(triangle, levels, row + 1, col + 1, ans, temp);
}

int minimumTotal(vector<vector<int>>& triangle) {
    int ans = INT_MAX;
    int temp = 0;
    int levels = triangle.size();
    doPrecess(triangle, levels, 0, 0, ans, temp);
    return ans;
}

方法二 借鉴网上（通过）

int minimumTotal(vector<vector<int>>& triangle) {
    if(triangle.empty() || triangle[0].empty())
        return 0;
    int m = triangle.size(), n = triangle[m - 1].size();
    for(int i = 1; i < m; ++i){
        for(int j = 0; j < triangle[i].size(); ++j){
            if(j == 0){
                triangle[i][j] += triangle[i - 1][j];
            }
            else if(j == triangle[i].size() - 1){
                triangle[i][j] += triangle[i - 1][j - 1];
            }
            else{
                triangle[i][j] += min(triangle[i - 1][j - 1], triangle[i - 1][j]);
            }
        }
    }
    auto it = min_element(triangle[m - 1].begin(), triangle[m - 1].end());
    return *it;
}