# 斐波那契数列
def fib(n):
    a, b = 1, 1
    for i in range(n-1):
        a, b = b, a+b
    return a


print(fib(10))


# 使用递归
def fib(n):
    if n == 1 or n == 2:
        return 1
    return fib(n - 1)+fib(n - 2)


print(fib(10))


# 输出前 10 个斐波那契数列
def fib(n):
    if n == 1:
        return [1]
    if n == 2:
        return [1, 1]
    fibs = [1, 1]
    for i in range(2, n):
        fibs.append(fibs[-1] + fibs[-2])
    return fibs


print(fib(10))
