算法练习 (3) 杨辉三角

public static void main(String[] args){
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();    //输入行数
		int[][] a = getTriangle(n);
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j <=i; j++) {
				System.out.printf("%-3d", a[i][j]);
			}
			System.out.println();
		}
	}
	static  int[][] getTriangle(int n){
		int a[][] = new int[n][n];
		for (int i=0; i<n; i++)
		{
			a[i][0]=1;
			a[i][i]=1;
		}
		for (int i=1; i<a.length; i++)
		{
			for (int j = 1; j <= i; j++) {
				a[i][j] = a[i-1][j-1] + a[i-1][j];
			}
		}
		return a;
	}

输出结果