数组-02. 打印杨辉三角

import java.util.Scanner;

public class Main {

	/**
	 * 数组-02. 打印杨辉三角
	 */
	public static void main(String[] args) {

		Scanner s = new Scanner(System.in);

		int n = s.nextInt();

		int[][] nums = new int[n][];

		for (int i = 0; i < n; i++) {
			nums[i] = new int[i + 1];

			for (int j = 0; j < nums[i].length; j++) {
				if (j == 0 || j == nums[i].length - 1) {
					nums[i][j] = 1;
				} else {
					nums[i][j] = nums[i - 1][j - 1] + nums[i - 1][j];
				}
			}

		}

		for (int i = 0; i < nums.length; i++) {

			for (int k = nums.length - i - 1; k > 0; k--) {
				System.out.print(" ");
			}

			for (int j = 0; j < nums[i].length; j++) {
				System.out.printf("%4d", nums[i][j]);
			}
			System.out.println();
		}
	}
}