Calculating the number of columns in python Feibolaqi (generator mode, recursively, otherwise)

Problem introduced - Feibolaqi number of columns

Fibonacci number (Fibonacci sequence), also known as golden columns, because mathematician Leonardo Fibonacci (Leonardoda Fibonacci) as an example to the rabbit breeding and the introduction, it is also known as "Rabbit series," referring to such a series is: 1,1,2,3,5,8,13,21,34, ...... mathematically as follows fibonacci recursion method is to define: F (1) = 1, F (2) = 1, F (n) = F (n-1) + F (n-2) (n> = 3, n∈N *)

1. Generator manner

def Fibonacci(n):
    a, b = 1, 1
    num = 1
    while num <= n:
        result = a
        a, b = b, a + b
        num += 1
        yield result

# 调用函数返回值是一个生成器，使用for循环遍历取值
for i in Fibonacci(10):
    print(i)

2. recursively

def Fibonacci(i):
    if i <= 1:
        return 1
    else:
        return Fibonacci(i - 1) + Fibonacci(i - 2)

# 生成前10个数列
for i in range(10):
    print(Fibonacci(i))

3. Other ways

def Fibonacci(n):
    a, b = 0, 1
    for i in range(10):
        a, b = b, a + b
        print(a)

Fibonacci(10)

def Fibonacci(num):
    alist = []
    for i in range(num):
        if i == 0 or i == 1:
            alist.append(1)
        else:
            alist.append(alist[i - 1] + alist[i - 2])
    print(alist)


Fibonacci(10)