LeetCode 120. Triangle_120. triangle java-CSDN博客

本文链接：https://blog.csdn.net/Llunnn/article/details/78375095

Dynamic Programming

题目描述：
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.

解题思路：
用动态规划进行解题。
考虑储存走到每一个数的最小路径和作为一个状态。
状态转移方程为：sum[j] = min(sum[j-1], sum[j]) + triangle[i][j];
边界的值作为0处理。

Bonus部分则是让每次从后往前更新sum，则可实现O(n)的空间复杂度。因为上一层中在当前状态之后的状态对当前没有影响。

代码实现：

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        int height = triangle.size();
        vector<int> sum;
        for (int i = 0; i < height; i++) {
            sum.push_back(0);
        }
        sum[0] = triangle[0][0];
        for (int i = 1; i < height; i++) {
            sum[i] = sum[i-1]+triangle[i][i];
            for (int j = i-1; j >= 1; j--) {
                sum[j] = minSum(sum[j-1], sum[j]) + triangle[i][j];
            }
            sum[0] += triangle[i][0];
        }
        int min = sum[0];
        for (int i = 1; i < height; i++) {
            if (sum[i] < min) min = sum[i];
        }
        return min;
    }
private:
    int minSum(int a, int b) {
        if (a < b) return a;
        return b;
    }
};