解法一、循环求解
def Fibonacci(n):
f1 = 1
f2 = 1
ls = [1, 1]
if n <= 0:
return None
elif n == 1:
ls.pop(1)
elif n == 2:
pass
else:
for i in range(n-2):
f1, f2 = f2, f1+f2
ls.append(f2)
return ls
if __name__ == "__main__":
n = eval(input("生成斐波拉切数列的数量:"))
while True:
print(Fibonacci(n))
n = eval(input("生成斐波拉切数列的数量:"))
解法二、递归求解
def fFive(n):
if n == 1 or n == 2:
return 1
return fFive(n-1)+fFive(n-2)
if __name__ == "__main__":
print(fFive(5))