常见JAVA算法题

 

 

 1.杨辉三角（数组求解）

public   class  YangHui{
     static   void  yanghui( int  a[][], int  ROW){
         for ( int  i = 0 ;i <= ROW;i ++ ){
             for ( int  j = 0 ;j <= a[i].length - 1 ;j ++ ){
                 if (i == 0   ||  j == 0   ||  j == a[i].length - 1 ){
                    a[i][j] = 1 ;
                } else {
                    a[i][j] = a[i - 1 ][j - 1 ] + a[i - 1 ][j];
                }    
            }
        }
         for ( int  i = 0 ;i <= ROW;i ++ ){
             for ( int  j = 0 ;j <= a[i].length - 1 ;j ++ ){
                System.out.print(a[i][j] + "   " );
            }
            System.out.println();
        }
    }
     public   static   void  main(String[] args){
         final   int  ROW = 5 ;
         int  a[][] = new   int [ROW + 1 ][];
         for ( int  i = 0 ;i <= ROW;i ++ ){
            a[i] = new   int [i + 1 ];
        }
        yanghui(a,ROW);
    }
}