Triangle

Triangle

  Total Accepted: 3987  Total Submissions: 15556 My Submissions

 

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.

 

DP求解。 从最后一层开始往上，依次记录每个点的最优，直到顶层。

例如：

 

     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]

从最后层开始，最后层合并倒数第二层后：

     [2],
    [3,4],
   [7,6,10],

依次向上合并：

     [2],
    [9,10],

直到顶层：

     [11],

public static int minimumTotal(ArrayList<ArrayList<Integer>> triangle){
    if(triangle.size() == 0) return 0;
    for(int i = triangle.size()-1; i > 0; i--){
        ArrayList<Integer> upper = triangle.get(i-1);
        ArrayList<Integer> lower = triangle.get(i);
        for(int j = 0 ; j <upper.size();j++){
            upper.set(j, Math.min(lower.get(j), lower.get(j+1)) + upper.get(j));
        }
    }
    int min = Integer.MAX_VALUE;
    for(int i : triangle.get(0)) min = Math.min(min,i);
    return min;
}