蓝桥杯 基础练习 杨辉三角形 JAVA

import java.util.Scanner;

class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[][] = new int

;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j <= i; j++) {
if (i == 0 || j == 0) {
a[i][j] = 1;
} else if (i == j) {
a[i][j] = 1;
} else {
a[i][j] = a[i - 1][j] + a[i - 1][j - 1];
}
}
}

for (int i = 0; i < a.length; i++) {
for (int j = 0; j <= i; j++) {
System.out.print(a[i][j] + " ");
}
System.out.println();
}

}

}