规律化递归

递归思想：

具体案例：

package Java_project_1;

import java.util.Scanner;

public class RecursionDemo {
    public static void main(String[] args) {
        System.out.println(f(5));
    }
    public static int f(int n){
        if (n==1){
            return 1;
        }else {
            return f(n-1)*n;
        }
    }
}

package Java_project_1;

import java.util.Scanner;

public class RecursionDemo {
    public static void main(String[] args) {
        System.out.println(f(5));
    }
    public static int f(int n){
        if (n==1){
            return 1;
        }else {
            return f(n-1)+n;
        }
    }
}

package Java_project_1;

import java.util.Scanner;

public class RecursionDemo {
    public static void main(String[] args) {
        System.out.println(f(1));
    }
    public static int f(int n){
        if (n==10){
            return 1;
        }else {
            return 2*f(n+1)+2;
        }
    }
}