java 斐波那契函数 Fibonacci 两种实现

/**
 * Created by wangting1 on 2017/7/27.
 */
public class Fibonacci {

    //f(0) = f0
    //f(1) =1
    //f(n) = f(n-1)+f(n-2)    n>1
    public static int fibonacci(int n ){
        if(n==0){
            return 0;
        }else if(n==1){
            return 1;
        }else {
            return fibonacci(n-1)+fibonacci(n-2);
        }
    }

    public static int fibonacci2(int n){
        int n0=0;
        int n1=1;
        int n2=2;
        for(int i=1; i<n; i++){
            n2=n0+n1;
            n0=n1;
            n1=n2;
        }
        return n2;
    }

    public static void main(String args[]){
        System.out.println(Fibonacci.fibonacci(10));
        System.out.println(Fibonacci.fibonacci2(10));
    }

}