LeetCode刷题笔录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.

这是个动态规划问题，用一个ArrayList来记录从第一层到当前level的每一个位置的min sum。

比如level 1的 min sum数组是[2]. level 2是[5,6]. level 3是[11,10,13]。

递推的公式是levelSum[i]=level[i]+ min{previousLevelSum[i-1], previousLevelSum[i]}。

对于每层的最左边和最右边的元素要单独处理一下，因为这两个元素的sum值没有选择。

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int n = triangle.size();
        ArrayList<Integer> array = new ArrayList<Integer>();
        if(triangle == null || n == 0)
            return 0;
        array.add(triangle.get(0).get(0));
        for(int i = 1; i < n; i++){
            ArrayList<Integer> level = (ArrayList<Integer>) triangle.get(i);
            ArrayList<Integer> levelSum = new ArrayList<Integer>(level.size());
            //the leftmost sum is the leftmost number of the current level plus the leftmost sum of the previous level
            levelSum.add(level.get(0) + array.get(0));
            for(int j = 1; j < level.size() - 1; j++){
                levelSum.add(Math.min(array.get(j - 1), array.get(j)) + level.get(j));
            }
            //the rightmost sum of the current level
            levelSum.add(level.get(level.size() - 1) + array.get(array.size() - 1));
            array = levelSum;
        }
        
        //return the minimum
        int min = Integer.MAX_VALUE;
        for(Integer sum : array){
            min = Math.min(sum, min);
        }
        return min;
    }
}