Java中的杨慧三角编写

import java.util.Scanner;
public class DemoTest {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入N的值：");
int num = sc.nextInt();
int[][] arr = new int[num][num];
sortMethod(arr);
}
private static void sortMethod(int[][] arr) {
for (int i = 0; i < arr.length; i++) {
for (int n = 0; n <= i; n++) {
arr[i][0] = 1;
arr[n][i] = 1;
if (i >= 2 && n >= 1 && n < i) {
arr[i][n] = arr[i - 1][n - 1] + arr[i - 1][n];
}
}
}
for (int i = 0; i < arr.length; i++) {
for (int n = 0; n <= i; n++) {
System.out.print(arr[i][n] + "   ");
}
System.out.println();
}
}

}

写完后发现比网上的大多数算法都简单，哈哈！