1. 循环实现斐波那契数列
输入n,输出前n个斐波那契数列:
n = int(input())
first = 0
second = 1
third = 1
for i in range(0,n):
print(third)
third = first + second #第一个数和第二个数相加
first = second #指针后移
second = third
从0~n-1遍历,一共n次。
数列从0开始计算,该循环从第一个数1开始输出;
因此,即使输入了1、2,虽然不足3,也能正常输出。
2.递归实现
def Fibonacci(n):
if n == 1:
return 1
if n == 2:
return 1
return Fibonacci(n-1) + Fibonacci(n-2)
m = int(input())
for i in range(1,m+1):
num = Fibonacci(i)
print(num)