五十七.斐波那契数列JAVA

public class Main {
    
    
    public static int fibonacci(int n) {
    
    
        if ((n == 0) || (n == 1))
            return n;
        else
            return fibonacci(n - 1) + fibonacci(n - 2);
    }
    public static void main(String[] args) {
    
    
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        for (int i = 0; i <= n; i++)
        {
    
    
            System.out.printf("Fibonacci of %d is: %d\n", i, fibonacci(i));
        }
    }