杨辉三角

public class YangHui{
        public static void main(String arg[]){
                int i=1,j=1,iOf=0;
                int iN = 20;
                int[][] arr = new int[iN][iN];
                for(i=1;i<iN;i++){
                        iOf = iN - i - 1;
                        outSpace(iOf);
                        for(j=1;j<=i;j++){
                                if(i==1||j==1){
                                        arr[i][j] = 1;
                                }else{
                                        arr[i][j] = arr[i-1][j -1] + arr[i-1][j];
                                }
                                System.out.print(arr[i][j] + " ");
                        }
                        System.out.println("");
                }
        }
        public static void outSpace(int iNum){
                for(int i=1;i<=iNum;i++){
                        System.out.print(" ");
                }
        }
}

 

posted @ 2012-08-01 14:41  黑冰.org  阅读(151)  评论(0编辑  收藏  举报