java杨辉三角（可控行数）

import java.util.Scanner;
public class YangHui {
    public static void main(String[] args){
        //关键规律：arr[i][j] = arr[i-1][j] + arr[i-1][j-1]
        Scanner myScanner = new Scanner(System.in);
        System.out.println("输入行数:");
        int line = myScanner.nextInt();
        int[][] YangHui = new int[line][];
        for (int i = 0; i < YangHui.length; i++) {
            YangHui[i] = new int[i + 1];
            for (int j = 0; j < YangHui[i].length; j++) {
                if (j == 0 || j == YangHui[i].length - 1) {
                    YangHui[i][j] = 1;
                } else {
                    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();
        }
    }
}