斐波那契序列与黄金分割比

Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

fib = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

斐波那契递推公式

Python打印斐波那契递增序列

方法一：模拟

n = int(input())
fib = [0, 1]
for _ in range(2, n+1):
    fib.append(sum(fib[-2:])) 
print(fib[:n+1])

方法二：迭代

n = int(input())
fib = []
a = 0
b = 1
for _ in range(0, n+1): # n次
    fib.append(a)