杨辉三角

package com.atguigu.java;

public class YangHuiTest1 {
    
    public static void main(String[] args){
        
        int YangHui[][] = new int[10][];
        
        for(int i = 0;i < YangHui.length;i++){//不要写成YangHui[i].length
            YangHui[i] = new int[i+1];
            YangHui[i][0] = 1;
            YangHui[i][i] = 1;        
        }
        
        for(int i = 2;i <YangHui.length;i++){
            for(int j = 1;j < i;j++){
                YangHui[i][j] = YangHui[i-1][j-1] + YangHui[i-1][j];
            }
        }
        
        for(int i = 0;i < 10;i++){
            for(int j = 0;j < YangHui[i].length;j++){
                System.out.print(YangHui[i][j] + " ");
            }
            System.out.println();
        }
    }
}

 

posted @ 2021-01-30 17:41  pilipalala  阅读(47)  评论(0)    收藏  举报