def fib(n):
s,a,b=0,0,1
while s<n:
a,b= b,a+b
s +=1
print(b)
return
fib(7)
print('-------------------')
fib1 = lambda n: n if n <= 2 else fib1(n-1) + fib1 (n-2)
print(fib1(7))
print('------------')
def fib2(n):
a, b = 0, 1
for _ in range(n):
a, b = b, a + b
return b
print(fib2(7))
python 斐波那契数列
最新推荐文章于 2023-12-16 10:36:39 发布