public class hqh {
public static void main(String[] args) {
int[][] yanghui=new int[10][];//声明并初始化二维数组
for(int i=0;i<yanghui.length;i++) {
yanghui[i]=new int[i+1];
//首末元素赋值
yanghui[i][0]=yanghui[i][i]=1;
//非首末元素赋值
for(int j=1;j<yanghui[i].length-1;j++) {
yanghui[i][j]=yanghui[i-1][j-1]+yanghui[i-1][j];
}
}
for(int i=0;i<yanghui.length;i++) {//遍历二维数组
for(int j=0;j<yanghui[i].length;j++) {
System.out.print(yanghui[i][j]+" ");
}
System.out.println();
}
}
}
Java实现杨辉三角
于 2022-09-22 16:17:54 首次发布