Java 杨辉三角

a_pav

于 2020-02-24 22:53:19 发布

阅读量153

点赞数

分类专栏： java

本文链接：https://blog.youkuaiyun.com/sofewave_hand_LI/article/details/104487807

版权

java 专栏收录该内容

21 篇文章

订阅专栏

public static void main(String[] args) {
       /*杨辉三角*/
       int[][] yanghui=new int[10][0];
       for (int i = 0; i < yanghui.length; i++) {
           yanghui[i]=new int[i+1];
       }
       for (int i = 0; i < yanghui.length; i++) {
           for (int j = 0; j < yanghui[i].length; j++) {
               yanghui[i][0]=yanghui[i][i]=1;
               if (i>1&&j<i&&j>0) {
                   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]+"\t");
           }
           System.out.println();
       }

   }
}