Java方法06递归

package com.Leo.method;

public class Demo05 {
    public static void main(String[] args) {
        Demo05 test = new Demo05();
        test.test();

    }
    public void test(){
        test();
    }

package com.Leo.method;

public class Demo06 {
    //递归思想
    public static void main(String[] args) {
        System.out.println(f(5));

    }
    public static int f(int n){
        if (n==1){
            return 1;
        }else {
            return n*f(n-1);
        }
    }
}

}