📅  最后修改于: 2020-10-30 01:09:40             🧑  作者: Mango
斐波那契数列:
斐波那契数列指定了一系列数字,在下一个数字是通过将前两个数字相加而找到的。
例如:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on....
请参阅以下示例:
nterms = int(input("How many terms you want? "))
# first two terms
n1 = 0
n2 = 1
count = 2
# check if the number of terms is valid
if nterms <= 0:
print("Plese enter a positive integer")
elif nterms == 1:
print("Fibonacci sequence:")
print(n1)
else:
print("Fibonacci sequence:")
print(n1,",",n2,end=', ')
while count < nterms:
nth = n1 + n2
print(nth,end=' , ')
# update values
n1 = n2
n2 = nth
count += 1
输出: