JAVA 输出杨辉三角形

package day08;

import java.util.Scanner;

/**
 * @author 思弈禾
 * @PROJECT sggjava
 * @create 2022-08-19  15:19
 * 打印杨辉三角
 * 主要算法：yanghui[i][j]=yanghui[i-1][j-1]+yanghui[i-1][j];
 */
public class PascalTriangle {
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        System.out.print("请输入要打印的行数:");
        int line=input.nextInt();
        int[][] pascal=new int[line][];
        for (int i = 0; i < pascal.length; i++) {
            pascal[i]=new int[i+1];
            //给首位数字赋值
            pascal[i][0]=1;
            pascal[i][i]=1;
            //给其他位置数字赋值
            for (int j = 1; j < pascal[i].length-1; j++) {
                pascal[i][j]=pascal[i-1][j-1]+pascal[i-1][j];
            }
        }
        //遍历输出数组
        for (int i = 0; i < pascal.length; i++) {
            for (int j = 0; j < pascal[i].length; j++) {
                System.out.print(pascal[i][j]+"\t");
            }
            System.out.println();
        }
    }
}