题目描述
还记得中学时候学过的杨辉三角吗?具体的定义这里不再描述,你可以参考以下的图形:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
输入
输入只包含一个正整数n(1 <= n <= 30),表示将要输出的杨辉三角的层数。
输出
输出相应层数的杨辉三角,每一层的整数之间用一个空格隔开。
样例输入
4
样例输出
1 1 1 1 2 1 1 3 3 1
代码:
import java.util.*;
public class Main {
public static void main(String[] args){
YangHui yanghui = new YangHui();
yanghui.shuchu();
}
}
class YangHui{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
public void shuchu(){
if(n == 1){
System.out.print(1);
}else if(n == 2){
System.out.print(1+"\n"+1+" "+1);
}else if(n >= 3){
System.out.println(1+"\n"+1+" "+1);
int[] shang = {1,1};
for(int i = 3;i <= n;i ++){
int[] shuzu = new int[i];
shuzu[0] = 1;
shuzu[i-1] = 1;
for(int j = 0;j < shang.length - 1;j ++){
shuzu[j+1]=shang[j]+shang[j+1];
}
shang = shuzu;
for(int k = 0;k < shuzu.length;k ++){
System.out.print(shuzu[k]+" ");
}
System.out.println();
}
}
}
}