120. Triangle

Problem Description:

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.

Analysis:

本题的思路采用回溯法，从下而上来进行，每次取下一行相邻两个元素的最小值与当前值相加，依次类推到最上面一个元素。代码如下：

Code:

class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int sumValue = Integer.MAX_VALUE;
        int[] temp = new int[triangle.size()];
        for(int i = triangle.size() - 1; i >= 0; i--) {
            for(int j = 0; j < triangle.get(i).size(); j++) {
                if(i + 1 > triangle.size() - 1) {
                    temp[j] = triangle.get(i).get(j);
                } else {
                    temp[j] = Math.min(temp[j], temp[j + 1]) + triangle.get(i).get(j);
                }
            }
        }
        return temp[0];
    }
}