120. Triangle

难度: Medium

题目描述

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
• -104 <= triangle[i][j] <= 104

 

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

解题思路

代码实现

解决方案

java

class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {

        int n = triangle.size();

        Integer[] dp = new Integer[n];
        dp = triangle.get(n-1).toArray(new Integer[0]);

        for (int j = n-2; j >-1; j--) {
            List<Integer> data = triangle.get(j);
            int dSize = data.size();
            for (int i = 0; i <dSize; i++) {
                dp[i] = Math.min(dp[i], dp[i + 1]) + data.get(i);

            }
        }

        return dp[0];

    }
}