杨辉三角实现

import java.util.Scanner;
public class fei {
public static void main(String[] args) {
Scanner ma=new Scanner(System.in);
System.out.println("请输入杨辉三角行数：");
int sum=ma.nextInt();
int[] a=printYangHui(sum);
int f=1;
int count=0;
int num=sum;
for(int i=1;i<=sum;i++){
for(int k=1;k<=num;k++){
System.out.print(" ");
}
num--;
count++;
int flag=(i)*(i-1)/2;
for(int j=1;j<=count;j++){
System.out.print(" "+a[flag+j]);
}
System.out.println();
}

}
public static int[] printYangHui(int col){
int lhng=(col+1)*col/2;
int[] a=new int[lhng+1];
a[0]=lhng;
a[1]=1;
a[2]=1;
a[3]=1;
int count=2;
for(int i=3;i<=col;i++){
count++;
int flag=i*(i-1)/2;
for(int j=1;j<=count;j++){
if(j==1||j==count){
a[flag+j]=1;
}else{
a[flag+j]=a[(i-2)*(i-1)/2+(j-1)] + a[(i-2)*(i-1)/2+j];
}
}
}
return a;
}

}

运行结果：

请输入杨辉三角行数：
10
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1

转载于:https://www.cnblogs.com/jcdz/p/10598234.html