【LeetCode】Triangle

Triangle 
Total Accepted: 5496 Total Submissions: 21239 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.

有两种思路，1是直接递归，求出所有路径中最小的一个。递归有重复计算，我觉得像这种题目应该不是单纯的考察递归，应该会超时，我没有试。
2、dp，声明数组int dp[][] = new int[size][size];i表示第i行，j表示第j个数。
也就是说，dp[i][j]表示从底层到i层第j个数的最小值为多少，那么一直计算到顶层，dp[0][0]就是答案。
Java AC

public class Solution {
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        if(triangle == null || triangle.isEmpty()){
            return 0;
        }
        int size = triangle.size();
        int dp[][] = new int[size][size];
        for(int i = 0; i < size; i++){
            dp[size-1][i] = triangle.get(size-1).get(i);
        }
        for(int i = size-2; i >= 0; i--){
            for(int j = 0; j <= i; j++){
                dp[i][j] = Math.min(dp[i+1][j],dp[i+1][j+1]) 
                			+ triangle.get(i).get(j);    
            }
        }
        return dp[0][0];
    }
}