Java实现斐波那契数列Fibonacci

import java.util.Scanner;

public class Main1 {




 static class  Fibonacci{

     int Fobonacci2(int n){
         if (n==0)
             return 0;
         else if (n==1)
             return 1;
         else
             return Fibonacci(n-1)+Fibonacci(n-2);
     }

         int Fibonacci(int n) {
        int result[] = new int[] { 0, 1 };
        if (n < 2)
            return result[n];
        int fibNMinusOne = 1;
        int fibNMinusTwo = 0;
        int fibN = 0;
        for (int i = 2; i <= n; i++) {
            fibN = fibNMinusOne + fibNMinusTwo;
            fibNMinusTwo = fibNMinusOne;
            fibNMinusOne = fibN;
        }
        return fibN;
    }}

    public static void main (String[] args) {
        Fibonacci a = new Fibonacci();
        Scanner n = new Scanner(System.in);
        int n1= n.nextInt();
     a.Fibonacci(n1);
        System.out.println(a.Fibonacci(n1));


    }
}