题目:
解答:
# -*- coding:utf-8 -*-
class Solution:
def Fibonacci(self, n):
# write code here
if(n==0):
return 0
if(n==1):
return 1
else:
f1=0
f2=1
i=1
while(i!=n):
t=f2
f2=f1+f2
f1=t
i=i+1
return f2