剑指offer——斐波那契数列

class Solution {
public:
    long long data[50];
    int Fibonacci(int n) {
        this->data[1] = data[2] = 1;
        for(int i = 2 ; i <= n ; i++){
            data[i] = data[i-1]+data[i-2];
        }
        return data[n];
    }
};