编程实现杨辉三角

编程实现杨辉三角

public class YangHuiTest {
    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];
            yangHui[i][0] = yangHui[i][i] = 1;
            if(i>1){
                for(int j=1;j<yangHui[i].length - 1;j++){
                    yangHui[i][j] = yangHui[i-1][j-1] + 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();
        }
    }
}
posted @ 2021-09-05 18:33  Clancy_gang  阅读(124)  评论(0编辑  收藏  举报