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).

public class Solution {
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        
        if (triangle == null || triangle.size() == 0) return Integer.MAX_VALUE;
        for (int i = 0; i < triangle.size(); i++) {
            minimum(triangle, i);
        }
        ArrayList<Integer> list = triangle.get(triangle.size() - 1);
        int min = list.get(0);
        for (int i = 0; i < list.size(); i++) {
            if (min > list.get(i)) {
                min = list.get(i);
            }
        }
        return min;
    }
    
    public void minimum(ArrayList<ArrayList<Integer>> triangle, int r) {
        if (r == 0) return;
        ArrayList<Integer> list = triangle.get(r);
        ArrayList<Integer> uppperlist = triangle.get(r - 1);
        for (int i = 0; i < list.size() ; i++) {
            if (i == 0) {
                list.set(i, list.get(i) + uppperlist.get(i));
            } else if (i == list.size() - 1) {
                list.set(i, list.get(i) + uppperlist.get(i - 1));
            } else {
                list.set(i, list.get(i) + min(uppperlist.get(i - 1), uppperlist.get(i)));
            }
            
        }
    }
    
    public int min(int a, int b) {
        if (a < b) return a;
        return b;
    }
}