《Python数学编程》练习-day001
1.斐波那契序列:
斐波那契序列是一系列数字,该系列中的第i(≥ 3)个数是前两个数字之和,也就是位置(i-2)和(i-1)上的数字之和。
2. 基于Python实现:
def fibo(n):
if n == 1:
return [1]
if n == 2:
return [1, 1]
# n > 2
a = 1
b = 1
# first two members of the series
series = [a, b]
for i in range(n):
c = a + b
series.append(c)
a = b
b = c
return series
3. 运行结果:
print(fibo(10))
>> [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]