基本思想
确立递归头,要有递归底。
import java.util.Scanner;
public class Demo01 {
public static void main(String[] args) {
System.out.println("请输入阶乘数:");
Scanner scanner=new Scanner(System.in);
int a=scanner.nextInt();
Demo01 demo01=new Demo01();
System.out.println("该数的阶乘为:"+demo01.recursion(a));
}
public int recursion(int a){
if(a==1){
return a;
}else {
return a*recursion(a -1);
}
}
}