杨辉三角
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
[1, 6, 15, 20, 15, 6, 1]
public class Dmeo06 { public static void main(String[] args) { int[][]arr=new int[7][]; for (int i = 0; i < arr.length; i++) { arr[i]=new int[i+1]; for (int j = 0; j < arr[i].length; j++) { if (j==0||i==j){ arr[i][j]=1; }else{ arr[i][j]=arr[i-1][j-1]+arr[i-1][j]; } } } for (int i = 0; i < arr.length; i++) { System.out.println(Arrays.toString(arr[i])); } } }