计算n的阶乘,使用递归
n的阶乘
n * (n-1) * (n-2) *… *1
public class RecursionTest05{
public static void main(String[] args){
java.util.Scanner s = new java.util.Scanner(System.in);
System.out.print("请输入n的值:");
int n =s.nextInt();
System.out.println(method(n));
}
public static int method(int n){
if (n == 1)
{
return 1;
}
return n * method(n-1);
}
}