public void PascalsTriangle {
// TODO Auto-generated method stub
int[][] a= new int[6][6];
//求值
for(int i = 0 ; i < a.length ; i ++)
{
for(int j=0;j<=i;j++)
{
if(i==j || j==0)
a[i][j]=1;
else{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
}
//分别输出空格和数值
String c =" ";
for(int i = 0 ; i < a.length ; i ++)
{
for(int j = 0 ; j < 6-i-1 ; j ++ )
{
System.out.printf("%-2s",c);
}
for(int j = 0 ; j <=i ; j ++ )
{
System.out.printf(" %-2d ",a[i][j]);
}
System.out.println();
}
Java实现杨辉三角
最新推荐文章于 2024-09-12 16:20:54 发布