triangle Java code

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 is11(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.

import java.util.*;
public class Solution {
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        int length=triangle.size();
        int[] result = new int[length];
        ArrayList<Integer> list=triangle.get(length-1);
        for(int i=0;i<length;i++){
            result[i]=list.get(i);
        }
        for(int i=length-2;i>=0;i--){
            for(int j=0;j<i+1;j++){
                result[j]=Math.min(result[j],result[j+1])+triangle.get(i).get(j);
            }
        }
        return result[0];
    }
}