python每日一练斐波那契递归改写输出前20个数,Python:创建前n个斐波纳契数的列表...

I am new to Python and to these forums.

My question is: How can I create a list of n Fibonacci numbers in Python?

So far, I have a function that gives the nth Fibonacci number, but I want to have a list of the first n Fib. numbers for future work.

For example:

fib(8) -> [0,1,1,2,3,5,8,13]

解决方案

Try this, a recursive implementation that returns a list of numbers by first calculating the list of previous values:

def fib(n):

if n == 0:

return [0]

elif n == 1:

return [0, 1]

else:

lst = fib(n-1)

lst.append(lst[-1] + lst[-2])

return lst

It works as expected:

fib(8)

=> [0, 1, 1, 2, 3, 5, 8, 13, 21]

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值