#斐波那契数列
def fib(n):
a,b = 0,1
count = 0
while count < n:
a,b = b,a + b
count = count + 1
print(a,end=',')
fib(10)
结果:
1,1,2,3,5,8,13,21,34,55,
#递归
def fib(n):
if n == 0 or n == 1:
return n
else:
return fib(n - 1) + fib(n - 2)
print(fib(10))
结果:
55