[剑指Offer] 7.斐波那契数列

class Solution {
public:
    int Fibonacci(int n) {
        int res[40] = {0};
        res[0] = 1;
        res[1] = 1;
        for(int i = 2;i < n;i ++){
            res[i] = res[i - 1] + res[i - 2];
        }
        return res[n - 1];
    }
};