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

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

思路一：递归会超出时间限制

class Solution {
public:
    int fib(int n) {
        if(n<2) return n;
        return fib(n-1) + fib(n-2);
    }
};

思路二：动态规划

class Solution {
public:
    int fib(int n) {
        if(n<2) return n;
        vector<int> dp(n+1);  //dp[i],为值为i时候结果为dp[i]
        dp[0] = 0;
        dp[1] = 1;
        for(int i=2;i<n+1;i++){
            dp[i] = dp[i-1] +dp[i-2];
            dp[i] = dp[i]%1000000007;
        }
       return dp[n];
    }
};