python实现斐波那契数列

class Fib(object):

    def __init__(self):
        self.a,self.b=0,1

    def __iter__(self):
        return self

    def __next__(self):
        self.a,self.b=self.b,self.a+self.b
        if self.a > 100:
            raise StopIteration()
        return self.a

运行

for n in Fib():
    print(n)

结果

1
1
2
3
5
8
13
21
34
55
89