题解 | #斐波那契数列#

#include <vector>
class Solution {
public:
    int Fibonacci(int n) {
        if (n == 1 || n == 2)
            return 1;
        vector<int> result(n);
        result[0] = 1;
        result[1] = 1;
        for (int i = 2; i < n; i++){
            result[i] = result[i-1] + result[i -2];
        }
        return result[n - 1];
    }
};