n<=39app
# -*- coding:utf-8 -*- class Solution: def Fibonacci(self, n): # write code here if n ==0: return 0 if n == 1: return 1 res=[0,1] for i in range(1,n): a = res[i-1] b = res[i] b+=a a=b-a res.append(b) return res[-1]
2019-11-28 09:30:07spa