知道了通项公式，那代码就非常简单了
class Solution:
def Fibonacci(self, n):
# write code here
res = [0, 1, 1, 2]
while len(res) <= n:
res.append(res[-1] + res[-2])
return res[n]
原文：https://www.cnblogs.com/dpnlp/p/fei-bo-na-qi-shu-lie.html