Python实现斐波那契数列

import sys

方法一：
def fibonacci(n):  # 生成器函数 - 斐波那契
    a, b, counter = 0, 1, 0
    while True:
        if (counter > n):
            return
        yield a
        a, b = b, a + b
        counter += 1


f = fibonacci(10)  # f 是一个迭代器，由生成器返回生成

while True:
    try:
        print(next(f), end=" ")
    except StopIteration:
        sys.exit()

方法二
def generator():
    a, b = 1, 1
    while True:
        yield a
        a, b = b, a + b


b = generator()

for i in range(5):
    print(b.__next__())
    
方法三
class Solution:
    def Fibonacci(self, n):
         # write code here
         A = [0, 1]
         for i in range(n - 1):
            A.append(A[-1] + A[-2])

         return A

 print(Solution().Fibonacci(8))