悬赏问题,缺B都来!怎么用Java语言递归方法输出99乘法表,要完整的代码
public class Jiujiu {
public static void main(String[] args) {
for (int i = 1;i < 10;i++){
for (int j=1;j <= i;j++){
System.out.print(j + "*" + i + "=" + j * i + " ");
}
System.out.println();
}
}
}
怎样算递归。
class MultiTable {
public void printTable( int left, int right ) {
if (left == 1 && right == 1 ) {
System.out.printf( "%dx%d=%d " , left,right,left*right ) ;
return ;
}
if ( left == 1 ) {
printTable( right -1 , right -1 ) ;
System.out.println();
} else {
printTable( left -1 , right ) ;
}
System.out.printf( "%dx%d=%d " , left,right,left*right ) ;
}
public static void main(String[] args) {
MultiTable mt = new MultiTable() ;
mt.printTable( 9,9 ) ;
}
}
递归版本。
输出:
1x1=1
1x2=2 2x2=4
1x3=3 2x3=6 3x3=9
1x4=4 2x4=8 3x4=12 4x4=16
1x5=5 2x5=10 3x5=15 4x5=20 5x5=25
1x6=6 2x6=12 3x6=18 4x6=24 5x6=30 6x6=36
1x7=7 2x7=14 3x7=21 4x7=28 5x7=35 6x7=42 7x7=49
1x8=8 2x8=16 3x8=24 4x8=32 5x8=40 6x8=48 7x8=56 8x8=64
1x9=9 2x9=18 3x9=27 4x9=36 5x9=45 6x9=54 7x9=63 8x9=72 9x9=81
Press ENTER or type command to continue
package Test1;
public class Test2 {
public static int sum(int i, int j){
if (i == 0){
//返回整形值
return 1;
}
int result = sum(i - 1, j);
for (int a = 0; a < i; a++){
int y = a + 1;
System.out.print(y + "*" + i + "=" + (i * y)+ "\t");
}
System.out.print("\n");
return result;
}
public static void main(String[] args) {
sum(9,0);
}
}
结果。。。
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
1*5=5 2*5=10 3*5=15 4*5=20 5*5=25
1*6=6 2*6=12 3*6=18 4*6=24 5*6=30 6*6=36
1*7=7 2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49
1*8=8 2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64
1*9=9 2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81