蓝桥杯数字三角形 java

import java.util.Scanner;

public class dt {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] array = new int[n+1][n+1];
        int[][] sum = new int[n+1][n+1];
        for(int i = 0;i<n;i++){
            for(int j = 0;j<=i;j++){
                array[i][j] = sc.nextInt();
            }
        }

        for(int i = 0;i<=n;i++){
            sum[n-1][i] = array[n-1][i];
        }
        for(int i = n-2;i>=0;i--){
            for(int j = 0;j<=i;j++){
                sum[i][j] = array[i][j] +Math.max(sum[i+1][j],sum[i+1][j+1]);
            }
        }
        System.out.println(sum[0][0]);
    }
}