Java递归方法求n的阶乘，n的数列和斐波那契数列

通过递归方法求：（1）n的阶乘；（2）n的数列；（3）斐波那契数列

package com.java.oop;
import java.util.Scanner;
/**
 * @ClassName Recursion
 * @Description:    求n的阶乘。
 * @Author Seven
 * @Date 2021/7/26 17:18
 * @Version 1.0
 **/
public class Recursion {
    public static void main(String[] args) {
        System.out.println("请输入一个小于等于15的正整数：");
        Scanner scanner = new Scanner(System.in);
        int number = scanner.nextInt();
        Recursion test = new Recursion();
        int result = test.recursion(number);
        System.out.println(number+"的阶乘为："+result);
    }
    public int recursion(int n){
        if(n == 1){
            return 1;
        }else{
            return n*recursion(n-1);
        }
    }
}

package com.java.oop;
import java.util.Scanner;
/**
 * @ClassName Sequence
 * @Description:    递归方法求数列结果
 * @Author Seven
 * @Date 2021/7/27 8:39
 * @Version 1.0
 **/
public class Sequence {
    public static void main(String[] args) {
        System.out.println("请输入一个正整数：");
        Scanner scanner = new Scanner(System.in);
        int number = scanner.nextInt();
        Sequence test = new Sequence();
        int result = test.sequence(number);
        System.out.println("结果为："+result);
    }
    public int sequence(int number){
        if(number == 0){
            return 1;
        }else if(number == 1){
            return 4;
        }else{
            return 2*sequence(number - 1) + sequence(number - 2);
        }
    }
}

package com.java.oop;
import java.util.Scanner;
/**
 * @ClassName Fibonacci
 * @Description:    斐波那契数列
 * @Author Seven
 * @Date 2021/7/27 9:02
 * @Version 1.0
 **/
public class Fibonacci {
    public static void main(String[] args) {
        System.out.println("请输入一个正整数：");
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        Fibonacci test = new Fibonacci();
        System.out.println("斐波那契数列的结果为："+test.fibonacci(n));
    }
    public int fibonacci(int n){
        if(n == 1 || n == 0){
            return 1;
        }else{
            return fibonacci( n - 1) + fibonacci( n - 2);
        }
    }
}