时间复杂度O(n) # -*- coding:utf-8 -*-class Solution: def Fibonacci(self, n): # write code here if n<2: return n mi = 0 ma = 1 r = 0 while n-1: r = mi+ma mi = ma ma = r n -= 1 return r