杨辉三角

  public static void triange() { int rows = 10; int[][] array = new int[rows][]; for (int i = 0; i < 10; i++) { array[i] = new int[i + 1]; } for (int row = 0; row < rows; row++) { for (int column = 0; column < array[row].length; column++) { if (row == 0 || column == 0 || column == array[row].length - 1) { array[row][column] = 1; } else { array[row][column] = array[row - 1][column] + array[row - 1][column - 1]; } } } for (int row = 0; row < rows; row++) { for (int column = 0; column < array[row].length; column++) { System.out.printf("%5d", array[row][column]); } System.out.println(); } }