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

LeetCode 提示

题目难度 简单

原题链接 🔗 leetcode

题解 1.py

# 注意反向递归会超时class Solution:    def fib(self, n: int) -> int:        # if n<=1:        #     return n        # res = [0 for _ in range(n+1)]        # res[0], res[1] = 0, 1        # for i in range(2, n+1):        #     res[i] = res[i-1] + res[i-2]        # return res[n] % 1000000007
        a, b = 0, 1        for _ in range(n):            a, b = b, a+b        return a % 1000000007