Java递归解决斐波那契数列

1.斐波那契数列

1 1 2 3 5 8  13 21 34 55 89 144

F(n) = F(n-1)+(n-2)

F(6) = F(5)+F(4)

package 算法;

import java.util.Scanner;

public class A {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(f(n));
    }
    public static int f(int n) {
        if (n == 1) return 1;
        if (n == 2) return 1;
        return f(n - 1) + f(n - 2);
    }
}