递归求阶乘
public class Recursion {
public static void main(String[] args) {
while(true) {
System.out.print("输入大于零的整数求阶乘:");
int n = new Scanner(System.in).nextInt();
long r = f(n);
System.out.println(r);
}
}
private static long f(int n) {
if(n == 0) {
return 1;
}
return n*f(n-1);
}
}