主要就是a,b=b,a+b
# -*- coding:utf-8 -*-
class Solution:
def Fibonacci(self, n):
# write code here
if n==0:
return 0
if n==1:
return 1
if n == 2:
return 1
if n>=3:
a=1
b=1
li=[1,1]
while 2<n<=39:
a,b=b,a+b
li.append(b)
n-=1
return li[-1]