def fbnq(n):
a,b=0,1
if n != 0:
for k in range(n):
a,b=b,b+a
return b
else:
return 0
结果输出
print(fbnq(10))
#第十次结果89
def fbnq(n):
a,b=0,1
if n != 0:
for k in range(n):
a,b=b,b+a
return b
else:
return 0
结果输出
print(fbnq(10))
#第十次结果89