递归（99乘法表）

public class RecursionJJ {
public static void main(String args[]) {
m(9);
}

public static void m(int i) {
if (i == 1) {
System.out.println("1*1=1 ");
} else {
m(i - 1);// m(1) for(i=2),m(2) for(3=2)
for (int j = 1; j <= i; j++) {
System.out.print(j + "*" + i + "=" + j * i + " ");
}
System.out.println();
}
}
}

转载于:https://www.cnblogs.com/Lovemeifyoudare/p/10305216.html