def feibo(n):
if n <= 1:
return n
return (feibo(n-1) + feibo(n-2))
while
利用递归实现获取斐波拉契数列中第N个数字的值
最新推荐文章于 2022-05-17 11:35:11 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)
def feibo(n):
if n <= 1:
return n
return (feibo(n-1) + feibo(n-2))
while