题解 | #斐波那契数列#

class Solution:
    def Fibonacci(self , n: int) -> int:
        dp = [0]*n
        dp[0], dp[1] = 1, 1
        for i in range(2, n):
            dp[i] = dp[i - 1] + dp[i - 2]
        return dp[n - 1]