杨辉三角递归java_用Java 实现杨辉三角编程

import java.util.Scanner;

public class YHui{

int array[][];

public void creat()

{

for(int i=0;i

for(int j=0;j

{

if(j==0)  array[i][j]=1;

else if(i==j) array[i][j]=1;

else if(j>i) array[i][j]=0;

else array[i][j]=array[i-1][j-1]+array[i-1][j];

}

}

public static void main(String args[])

{

int n,m;

System.out.println("请输入行数n:");

Scanner sc = new Scanner(System.in);

n = sc.nextInt();

System.out.println("请输入列数m:");

m = sc.nextInt();

YHui aa=new YHui();

aa.array=new int [n][m];

aa.creat();

for(int i=0;i

{

for(int j=0;j

if(aa.array[i][j]==0) System.out.print(" ");

else System.out.print(aa.array[i][j]+" ");

System.out.println();

}

}

}