用JAVA编写杨辉三角

Posted 2023-02-24

//打印杨慧三角形。
int width=10;
for (int i = 0; i < n; i++)
for (int j = 0; j < (n - i)*width/2; j++)
System.out.print(" ");
for (int j = 0; j < i + 1; j++)
String formatter="%"+width+"d";
System.out.printf(formatter,array[i][j]);

System.out.print("\n");




我意思是这段输入什么意思

我的绝对正确 书上抄的 还验证过！
public static void main(String[]args)
int r=6;
int a[][]=new int[r+1][]; //表示6个一维数组组成
for(int i=0;i<=r;i++)
a[i]=new int[i+1]; //表示使用for循环为一维数组指定列数
YangHui(a,r);

static void YangHui(int a[][],int r)
for(int i=0;i<=r;i++)
for(int j=0;j<a[i].length;j++)
if(i==0||j==0||j==a[i].length-1)
a[i][j]=1;
else
a[i][j]=a[i-1][j-1]+a[i-1][j];


for(int i=0;i<=r;i++)
for(int j=0;j<a[i].length;j++)
System.out.print(a[i][j]+" ");
System.out.println();

参考技术A public class Yhsanjiao

static public void main(String[] args)
int[][] a=new int[10][10];
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)

if (j<i)

a[i][j]=1;
if(j==0)
a[i][j]=1;
else
a[i][j]=a[i-1][j-1]+a[i-1][j];

else
a[i][j]=1;



for(int i=0;i<10;i++)

for(int k=1;k<=10-i;k++)
System.out.printf(" ");

for(int j=0;j<=i;j++)
System.out.printf("%3d ",a[i][j]);

System.out.printf("\n");


参考技术B public static void main(String[] args)
int[][] number = new int[12][];
int row, list;
number[0] = new int[1];//赋值前要初始化
number[1] = new int[2];//赋值前要初始化
number[0][0] = 1;
number[1][0] = 1;
number[1][1] = 1;
System.out.println(number[0][0]);
for (row = 2; row <= 11; row++)
number[row] = new int[row + 1];//赋值前要初始化
number[row][0] = 1;
number[row][row] = 1;
System.out.print(number[row][0] + " ");
for (list = 1; list < row; list++) //list位置要控制
number[row][list] = number[row - 1][list - 1]
+ number[row - 1][list];
System.out.print(number[row][list] + " ");

System.out.println();

参考资料：http://zhidao.baidu.com/question/146890818.html?fr=ala0