最简单的递归（Java实现）

public class printNum {
    public static void printDigit(int num){//输入1234，输出1 2 3 4
        if(num<10){
            System.out.println(num);
        }
        else{
            printDigit(num/10);
            //1234 123digit（1234）12-digit(123) 1-digit(12)
            System.out.println(num%10);
        }

    }
    public static int factoral(int num){//求9*8*7*6*5*4*3*2*1
        if(num<=1){
            return 1;
        }
        //9*factoral(9-1)  8*factoral(8-1) 7*factoral(7-1)
        else return num*factoral(num-1);
    }
    
    public static int sumNum(int num){//求10+9+8+7+6……+1
        if(num==1){
            return 1;
        }
        else{
            return num+sumNum(num-1);//10+sum(10-1)  9+sum(9-1)  
        }
    }
    
    public static int digitSum(int num){//输入1234 输出1+2+3+4
        if(num==1){
            return 1;
        }
        else 
        //1234  4+digit(123) 3+digit(12)
            return num%10+digitSum(num/10);
    }
    public static int Fib(int num){
        if(num==1||num==2){
            return 1;
        }
        else {
            return Fib(num-1)+Fib(num-2);
        }
    }
    public static void main(String[] args) {
        System.out.println(factoral(5));
    }
}