用Python输出斐波那契数列的前20项,要用递归和非递归两种方法?
2个回答
展开全部
非递归:
int first = 1
print(first) # 第一项
int second = 1
print(second) # 第二项
int count = 2
while count < 20:
item = first + second
print(item)
first = second
second = item
count += 1
递归:
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
def main():
for i in range(1, 21):
print(fibonacci(i))
main()
int first = 1
print(first) # 第一项
int second = 1
print(second) # 第二项
int count = 2
while count < 20:
item = first + second
print(item)
first = second
second = item
count += 1
递归:
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
def main():
for i in range(1, 21):
print(fibonacci(i))
main()
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询