杨辉三角

package 杨辉三角;
import java.util.Scanner;
public class 杨辉三角
{


public static void main(String[] args)
{
System.out.print("请输入行数:"); 
Scanner scanner=new Scanner(System.in);
int num=scanner.nextInt();
int [][] ary= getTriangle(num);
print(ary);
// TODO 自动生成的方法存根


}
private static int [][] getTriangle(int num)
{
int [][] ary=new int[num][num];
int i,j;
for(i=0;i<ary.length;i++)
{
ary[i][0]=1;
ary[i][i]=1;
}
for(i=1;i<ary.length;i++)
{
for(j=1;j<=i;j++)
{
ary[i][j]=ary[i-1][j-1]+ary[i-1][j];
}
}
return ary;
}
private static void print (int [][] ary)
{
int i,j;
for(i=0;i<ary.length;i++)
{
ary[i][0]=1;
ary[i][i]=1;
}
for(i=0;i<ary.length;i++)
{
for(j=1;j<=i;j++)
{
System.out.printf("%-3d",ary[i][j]);
}
System.out.println();
}
}


}