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

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