力扣算法篇：斐波那契数列

题解：

class Solution {
public:
    int fib(int n) {
        //斐波那契数列
        if(n == 0 || n == 1){
            return n;
        }
        //动态规划
        vector<int> dp(n+1);
        dp[0] = 0;
        dp[1] = 1;
        //计算dp
        for(int i = 2;i<=n;i++){
            dp[i]  = (dp[i-1]+dp[i-2])%1000000007;
        }
        return dp[n];
    }
};