public class RecursionTest {
public static void main(String[] args) {
int n = 10;
int res = factorial(n);
String s = print(n);
System.out.println(n + "!: " + s + " = " + res);
}
public static int factorial(int n) { //计算阶乘
if (n == 1) {
return 1;
} else {
return n * factorial(n - 1);
}
}
public static String print(int n) { //打印算式
if (n == 1) {
return "1";
} else {
return n + "*" + print(n - 1);
}
}
}
输出结果:
10!: 10*9*8*7*6*5*4*3*2*1 = 3628800