杨辉三角

package com.ilqjx.csdn;

import java.util.Scanner;

public class YangHuiTest {
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt(); // 输入 n 作为杨辉三角的行数
		scanner.close();
		int[][] yangHui = new int[n][];
		for (int i = 0; i < yangHui.length; i++) {
			yangHui[i] = new int[i+1];
			yangHui[i][0] = yangHui[i][i] = 1;
			for (int j = 1; j < yangHui[i].length - 1; j++) {
				yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j];
			}
		}
		
		// 输出
		for (int i = 0; i < yangHui.length; i++) {
			for (int j = 0; j < yangHui[i].length; j++) {
				System.out.print(yangHui[i][j] + " ");
			}
			System.out.println();
		}
	}

}

执行结果：

5
1 
1 1 
1 2 1 
1 3 3 1 
1 4 6 4 1