数字三角形

public class Solution {
    /**
     * @param triangle: a list of lists of integers.
     * @return: An integer, minimum path sum.
     */
    public int minimumTotal(int[][] triangle) {
        // write your code here
        if(triangle.length == 1 && triangle[0].length ==1 ){
            return triangle[0][0];
        }
        int minnum = 0;
        for(int i = 1; i < triangle.length ; i++){
            for(int j = 0;j < triangle[i].length ; j++){
                if(j==0){
                    triangle[i][j] += triangle[i-1][j];
                }else if(j==(triangle[i].length - 1)){
                    triangle[i][j] += triangle[i-1][j-1];
                }else{
                    triangle[i][j] += Math.min(triangle[i-1][j],triangle[i-1][j-1]);
                }
                if(i == (triangle.length - 1) && j==0){
                    minnum = triangle[i][j];
                }else{
                    minnum = Math.min(minnum,triangle[i][j]);
                }
            }
        }
         return minnum;
    }
}