Triangle (Java)

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记录一行的状态（只和前一行的值有关）。如果dp记录所有位的状态，在for循环中dp的坐标很难写。而且从下到上最后只需要直接返回dp[0]的值即可，也无需四个值比较。dp[j] = triangle.get(i).get(j) + Math.min(dp[j], dp[j + 1]);

Source

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle){
    	if(triangle.size() == 0) return 0;
    	if(triangle.size() == 1) return triangle.get(0).get(0);
        int[] dp = new int[triangle.size()];  //2维的size是第一维的大小
        
        for(int i = 0; i < triangle.get(triangle.size() - 1).size(); i++)
        	dp[i] = triangle.get(triangle.size() - 1).get(i);
        
        for(int i = triangle.size() - 2; i >= 0; i--){
        	for(int j = 0; j < triangle.get(i).size(); j++){
        		dp[j] = triangle.get(i).get(j) + Math.min(dp[j], dp[j + 1]);
        	}
        }
        
        return dp[0];
    }
}

Test

    public static void main(String[] args){
    	List<List<Integer>> triangle = new ArrayList<List<Integer>>();
    	List<Integer> a = new ArrayList<Integer>();
    	a.add(2);
    	triangle.add(a);
    	a = new ArrayList<Integer>();
    	a.add(3);
    	a.add(4);
    	triangle.add(a);
    	a = new ArrayList<Integer>();
    	a.add(6);
    	a.add(5);
    	a.add(7);
    	triangle.add(a);
    	a = new ArrayList<Integer>();
    	a.add(4);
    	a.add(1);
    	a.add(8);
    	a.add(3);
    	triangle.add(a);
    	System.out.println(new Solution().minimumTotal(triangle));
    }