easy 剑指 Offer 斐波那契数列 动态规划

---

动态规划：

c++

class Solution {
public:
    int fib(int n) {
        vector<int> dp(n+3);
        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];
    }
};

python

class Solution:
    def fib(self, n: int) -> int:
        dp = [0 for _ in range(n+3)]   ## 创建列表
        dp[0] = 0
        dp[1] = 1
        for i in range(2,n+1):
            dp[i] = (dp[i-1] + dp[i-2]) % 1000000007  # python 取模 返回除法的余数

        return dp[n]

---