java 实例之杨辉三角

public class study{

public static void main(String args[]){

int i,j,level=7;

int Yang[][] = new int[level][];

System.out.println("杨辉三角");

for(i = 0;i<Yang.length;i++){

Yang[i] = new int[i+1];

}

Yang[0][0] = 1;

//第一个元素为1

}

for(i = 1;i<Yang.length;i++){

//左边为1

Yang[i][0] = 1;

Yang[i][Yang[i].length-1]=1;

//右边为1

for(j=1;j<Yang[i].length-1;j++){

Yang[i][j] = Yang[i-1][j-1]+Yang[i-1][j];

}

}

//输出杨辉三角形

for(i=0;i<Yang.length;i++){

for(j=0;j<Yang[i].length;j++){

System.out.print(Yang[i][j]+" ");

}

System.out.println();

//换行

}

}

转载于:https://www.cnblogs.com/future-zmy/p/6075950.html