用java的二维数组打印任意行数的杨辉三角

import java.util.Scanner;

public class YangHui1 {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		System.out.println("请输入你想要打印的杨辉三角的行数：");
		int number = scan.nextInt();
		
		//声明二维数组
		int[][] yangHui = new int[number][];
		
		//给二维数组赋值
		for(int i =0;i < yangHui.length;i++) {
			
			yangHui[i] = new int[i+1];//第i行有i+1个元素
			
			yangHui[i][0] = yangHui[i][i] = 1;//每一行的第0个和第i个元素都赋值为1
			
	//从第i=2行，第j=1列列开始，到这行最后一个元素-1结束，每个元素的值等于上行元素值+上行元素左边的值
			if(i > 1) {
				for(int j = 1;j < yangHui[i].length - 1;j++) {
					yangHui[i][j] = yangHui[i-1][j] + yangHui[i-1][j-1];
				}
			}
		}
		
		//遍历二维数组
		for(int i = 0;i < yangHui.length;i++) {
			for(int j = 0;j < yangHui[i].length;j++) {
				System.out.print(yangHui[i][j] + "\t");
			}
			System.out.println();
		}
	}
}

运行结果：