Java中实现FibonacciSequence数列的求解（递归方法）

package com.turbo.exer;

import java.util.Scanner;

/**
 * @auther LJH turbo
 * @date 2020-09-06 22:01
 */
public class FibonacciSequence {
    public static void main(String[] args) {
        FibonacciSequence test = new FibonacciSequence();
        Scanner scan = new Scanner(System.in);
        System.out.println("求Fibonacci数列的第几个数：");
        int x = scan.nextInt();
        System.out.println("所求的Fibonacci数是：" + test.Fibonacci(x));
    }
    public int Fibonacci(int n){
        if (n == 1){
            return 1;
        }else if(n == 2){
            return 1;
        }else{
            return Fibonacci(n - 1) + Fibonacci(n - 2);
        }
    }
}