package luoji;
import java.util.Scanner;
/* 1 2 3 4 5 6 7 8 j
* 1
* 1 1
* 1 2 1
* 1 3 3 1
* 1 4 6 4 1 a[5][2]= a[4][1]+a[4][2]
* 1 5 10 10 5 1 a[i][j]= a[i-1][j-1]+a[i-1][j]
* 1 6 15 20 15 6 1
* 1 7 21 35 35 21 7 1
* */
public class yanghuisanjiao {
public static void main(String[]args){
Scanner x = new Scanner(System.in);
System.out.println("请输入杨辉三角的长度");
int y = x.nextInt();
int[][] sum=new int[y+1][y+1];
for(int i = 1;i<y+1;i++){
for(int j =1;j<i+1;j++){
if(j!=1||i!=j){
sum[i][j] = sum [i-1][j-1]+ sum[i-1][j];
}else {
sum[i][1]=1;
sum[i][i=j]=1;
}
System.out.print(sum[i][j]+"\t");
}
System.out.println("");
}
}
}
|
|