斐波那契数列:
前两个数之和为第三个数,比如下面列表
[1,2,3,5,8,13,21,34]
现在利用递归思想:
def fib(x):
if x < 2:
return x
return (fib(x-2) + fib(x-1))
def main(n):
ret_list = []
for i in range(1,n):
ret_list.append( fib(i) )
return ret_list
print main(10)
结果是:
[1, 1, 2, 3, 5, 8, 13, 21, 34]