[刷题]Triangle

[LIntCode]Triangle

public class Solution {    /**     * @param triangle: a list of lists of integers.     * @return: An integer, minimum path sum.     */    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {        // 2015-05-13        if (triangle == null || triangle.size() == 0) {            return 0;        }        int n = triangle.size();        int[][] sum = new int[n][n];        for (int i = 0; i < n; i++) {            sum[n - 1][i] = triangle.get(n - 1).get(i);        }                for (int i = n - 2; i >= 0; i--) {            for (int j = 0; j <= i; j++) {                sum[i][j] = Math.min(sum[i + 1][j], sum[i + 1][j + 1])                     + triangle.get(i).get(j);            }        }                return sum[0][0];    }}