Java算法训练：杨辉三角

用户自定义杨辉三角

import java.util.Scanner;
public class lianxi_yanghui {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner nusScanner=new Scanner(System.in);
		int nusa=nusScanner.nextInt();
		for (int i = 0; i <= nusa; i++) {
			int[] a=yhsj(i);
			for (int j = 0; j < a.length; j++) {
				System.out.print(a[j]+"\t");
			}
			System.out.println("\n");
		}
		
	}
	public static int[] yhsj(int n){
		int[] num=new int[n];
		if (n==1) {
			num[0]=1;
			return num;
		}
		else{
		for (int i = 0; i < num.length; i++) {
			if (i==0 || i==num.length-1) {
				num[i]=1;
			}
			else {
				num[i]=yhsj(n-1)[i]+yhsj(n-1)[i-1];
			}
		}
		return num;
		}	
	}
}