《剑指Offer》题目——斐波拉契数列

public class Fibonacci {
    public static int fibonacci(int n){
        int res[] = new int[2];
        res[0]=1;
        res[1]=1;
        int temp = 0;
        if(n==0) return 0;
        if(n<=2) return res[n-1];
        for(int i=3; i<=n ; ++i){
            temp = res[0]+res[1];
            res[0] = res[1];
            res[1] = temp;
        }
        return temp;
    }
    public static void main(String[] args){
        System.out.println(fibonacci(40));
    }
}