剑指 Offer 10- I. 斐波那契数列

原题链接：剑指 Offer 10- I. 斐波那契数列

 solution:

        动态规划

class Solution {
public:
    int fib(int n) {
        if(n < 2) return n;
        vector<int> dp(n + 1);
        dp[0] = 0;
        dp[1] = 1;
        for(int i = 2;i <= n;i++) {
            dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
        }
        return dp[n];
    }
};