Java实现杨辉三角

Java实现杨辉三角

• 杨辉三角：如下图所示，每一行除了第一个和最后一个，每一个都是上一行相邻两个之和

• 源代码如下：

public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    System.out.print("请输入你需要多少层杨辉三角：");
    int n = scan.nextInt();
    int[][] arr = new int[n][];
    for (int i = 0; i < 10; i++)
    {
        arr[i] = new int[i + 1];
    }
    arr[0][0] = 1;
    for (int i = 0; i < arr.length; i++) {
        arr[i][0] = 1;
        for (int j = 1; j < arr[i].length - 1; j++) {
            arr[i][j]=arr[i-1][j-1] + arr[i-1][j];
        }
        arr[i][arr[i].length-1] = 1;
    }

    for (int i = 0; i < arr.length; i++) {
        System.out.print("(" + i + ")");
        for (int k = 0; k < arr.length - arr[i].length; k++) {
            System.out.print("    ");
        }
        for (int j = 0; j < arr[i].length; j++) {

            System.out.print(arr[i][j] + "        ");
        }
        System.out.println();
    }
}

• 运行结果