package a;
import java.util.Scanner;
public class AAA {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [][] array = new int [n][2*n-1];
print(array);
}
public static void print(int[][] array) {
for(int i=0;i<array.length;i++) {
for(int j=0;j<array[i].length;j++) {
int mid=(array[i].length)/2;
if(j==mid-i || j==mid+i) {
array[i][j]=1;
}else if(j>mid-i && j<mid+i){
array[i][j]=array[i-1][j-1]+array[i-1][j+1];
}
if(array[i][j]==0) {
System.out.print(" "+"\t");
}else{
System.out.print(array[i][j]+"\t");
}
}
System.out.println();
}
}
}
杨辉三角
最新推荐文章于 2023-08-12 17:41:26 发布