1.3 常见问题求解
def febo(num):
list_ = []
i = 1
j = 0
while len(list_) < num:
list_.append(i)
i, j = i + j, i
return list_class Febo:
def __init__(self):
self.i = 1
self.j = 0
self.times = 0
def __iter__(self):
return self
def __next__(self):
self.times += 1
self.i,self.j = self.i+self.j, self.i
return self.jLast updated