本文共 819 字，大约阅读时间需要 2 分钟。

public class Yanghui {  public static void main(String[] args) {    int[][] yangHui = new int[10][];    for(int i = 0; i < yangHui.length; i++) {      yangHui[i] = new int[i+1];      for(int j = 0; j < yangHui[i].length; j++) {        if (j == 0 || j == yangHui[i].length-1) {          yangHui[i][j] = 1;        } else {          yangHui[i][j] = yangHui[i-1][j] + yangHui[i-1][j-1];        }      }    }    for (int i = 0; i < yangHui.length; i++) {      for (int j = 0; j < yangHui[i].length; j++) {        System.out.print(yangHui[i][j] + " ");      }      System.out.println();    }    /**     *      *  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        1 7 21 35 35 21 7 1        1 8 28 56 70 56 28 8 1        1 9 36 84 126 126 84 36 9 1     *      */  }}

转载地址：https://liushilong.blog.csdn.net/article/details/116138802 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！