# 循环
def fibonacci_for(num):
a, b = 0, 1
l = []
for i in range(num):
l.append(a)
a, b = b, a + b
return l
# 递归
def fibonacci_recursive(num):
l = []
def fibonacci(num):
if num == 0:
return 0
if num < 2:
return 1
return fibonacci(num - 1) + fibonacci(num - 2)
for i in range(num):
l.append(fibonacci(i))
return l
if __name__ == '__main__':
res = fibonacci_recursive(4)
print(res)
【数据结构连载一栈】【斐波那契数列】python
最新推荐文章于 2024-10-04 18:59:43 发布