【剑指Offer】10.1 斐波那契数列

public class Solution {
    public int Fibonacci(int n) {
// 1 1 2 3 5
        if(n <= 1)
            return n;
        
        int l = 0;
        int r = 1;
        int temp = 0;
        for(int count = 2; count <= n; count++) {
           	temp = l;
            l = r;
            r = temp + r;
        }
        return r;
    }
}

public class Solution {
    private int[] temp = new int[40];
     
    public Solution() {
        temp[0] = 0;
        temp[1] = 1;
        for(int i = 2; i < temp.length; i++) {
            temp[i] = temp[i-1] + temp[i-2];
        }
    }
    
    public int Fibonacci(int n) {
// 1 1 2 3 5
        return temp[n];
    }
}