# -*- coding:utf-8 -*- class Solution: def Fibonacci(self, n): # write code here l0 = 0 l1 = 1 l = [l0, l1] if n == 0: return l0 elif n == 1: return l1 else: for i in range(2,n+1): l.append(l[i-1]+l[i-2]) return l[-1]
# -*- coding:utf-8 -*- class Solution: def Fibonacci(self, n): # write code here l0 = 0 l1 = 1 l = [l0, l1] if n == 0: return l0 elif n == 1: return l1 else: for i in range(2,n+1): l.append(l[i-1]+l[i-2]) return l[-1]