Given a triangle array, return the minimum path sum from top to bottom.

For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.

Example 1:

Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output: 11
Explanation: The triangle looks like:
2
3 4
6 5 7
4 1 8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).

Example 2:

Input: triangle = [[-10]]
Output: -10

Constraints:

1 <= triangle.length <= 200
triangle[0].length == 1
triangle[i].length == triangle[i - 1].length + 1
-10^4 <= triangle[i][j] <= 10^4

Follow up: Could you do this using only O(n) extra space, where n is the total number of rows in the triangle?

Solution

Dynamic Programming

Time complexity : O(n)
Space complexity : O(1)

class Solution {
public:
    int minimumTotal(vector<vector<int>>& t) {
        for (int l=0; l<t.size(); ++l) {
            for (int i=0; i<=l; ++i) {
                if (l==0 && i==0) continue;
                else if (i == 0) t[l][i] += t[l-1][i];
                else if (i == l) t[l][i] += t[l-1][i-1];
                else t[l][i] += min(t[l-1][i-1], t[l-1][i]);
            }
        }
        return *min_element(t.back().begin(), t.back().end());
    }
};

2           2
3 4         5 6
6 5 7       11 10 11
4 1 8 3     15 11 18 14