斐波那契数列迭代器实现方法

来源:互联网 发布:淘宝宝贝详情图被拉伸 编辑:程序博客网 时间:2024/06/08 08:17
class Fob(object):
def __init__(self,end_num):
self.end_num=end_num
self.num1=0
self.num2=1
self.n=0
def __next__(self):
if self.n<self.end_num:
res = self.num1
self.num1,self.num2=self.num2,self.num1+self.num2
self.n+=1
return res
else:
raise StopIteration

def __iter__(self):
return self


fob = Fob(10)
for num in fob:
print(num)
阅读全文
0 0
原创粉丝点击