尾递归:
def Fib(a,b,n):
if n==0:
return b
else:
return Fib(b,a+b,n-1)
递归:
def Fib(a):
if a==0 or a==1:
return 1
else:
return Fib(a-2)+Fib(a-1)
循环:
def Fib(n):
a=1
b=1
n = n - 1
while n>0:
temp=a
a=a+b
b=temp
n = n-1
return b