每日一道Leetcode - 剑指 Offer 10- I. 斐波那契数列 [动态规划]

Python:

class Solution:
    def fib(self, n: int) -> int:
        # 动态规划
        # dp[i+1] = dp[i]+dp[i-1]
        a,b = 0,1
        for _ in range(n):
            a,b = b,a+b
        return a % 1000000007

Java:

class Solution {
    public int fib(int n) {
        int a=0,b=1,sum;
        for(int i = 0;i<n;i++){
            sum = (a+b)%1000000007;
            a = b;
            b = sum;
        }
        return a;
    }
}