菲波那契数列

解题思路:

注意事项:

参考代码:

def fibonacci(n):
   dp = [0] * (n + 1)
   dp[0] = 0
   dp[1] = 1
   for i in range(2, n+1):
       dp[i] = dp[i - 2] + dp[i - 1]
   return dp[n]


n = int(input())
result = fibonacci(n)
print(result)