蓝桥杯--拿金币(DP动态规划)

import java.util.Scanner;
public class BlueBridge_first_01_goldcoins {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int index = sc.nextInt();
int[][] arr = new int[index][index];
for(int i = 0;i<index;i++) {
for(int j =0;j<index;j++) {
arr[i][j]= sc.nextInt();
}
}
for(int i = 0;i<index;i++) {
for(int j =0;j<index;j++) {
//若当前为上边界元素
if(i==0&&j>0) {
arr[i][j]= arr[i][j] + arr[i][j-1];
//若当前为左边界元素
}else if(j==0&&i>0) {
arr[i][j]= arr[i][j]+arr[i-1][j];
}else if (i>0){
arr[i][j] = arr[i][j] + Math.max(arr[i-1][j], arr[i][j-1]);
}
}
}
System.out.println(arr[index-1][index-1]);
}
}