def Fibonacci(n):
if n==0:
return 0
if n==1:
return 1
a = Fibonacci(n-1)
b = Fibonacci(n-2)
return a + b
for i in range(1,8):
print(Fibonacci(i))
斐波那契数列递归实现
最新推荐文章于 2024-04-25 17:04:59 发布
def Fibonacci(n):
if n==0:
return 0
if n==1:
return 1
a = Fibonacci(n-1)
b = Fibonacci(n-2)
return a + b
for i in range(1,8):
print(Fibonacci(i))