我正在尝试使用LIFO主体创建堆栈。我可以仅使用推入和弹出功能来做到这一点。但是我想创建一个 iter 和一个 next 函数来遍历整个堆栈。以下是我尝试过的方法,但无法真正弄清楚其逻辑。
class Stack:
def __init__(self):
self.stack = []
self.START = None
self.END = None
def push(self, item):
self.stack.append(item)
#print("item added to stack")
def pop(self):
return self.stack.pop()
#print("value removed according to LIFO")
def emptystack(self):
return len(self.stack) == 0
def __iter__(self):
self.Iterator = self.START
return self
def __next__(self):
if self.Iterator != None:
stack = self.Iterator
self.Iterator = self.Iterator.NEXT
return node
else:
raise StopIteration
def fullstack(self):
return self.stack
s = Stack()
s.push('1')
s.push('2')
s.push('6')
s.push('8')
s.push('11')
s.push('12')
s.pop()
s.push('50')
if s.emptystack():
print("Stack is empty")
else:
print(s.fullstack())
答案 0 :(得分:1)
您的Iterator
属性将始终为None
,因为在第一次调用 next 时,您将停止迭代。从关于__next__
的Python文档中,将 next 视为每个项目都被调用,直到没有更多要处理的项目为止:
从容器中返回下一个项目。如果没有其他项目,请引发StopIteration异常
您可以做的一件事是将self.Iterator
初始化为堆栈的长度(在__iter__
中),然后在每一步中递减直到达到0(然后提高StopIteration):
def __iter__(self):
self.Iterator = len(self.stack) - 1 # initialize to the index of the last element
return self
def __next__(self):
if self.Iterator >= 0:
current_value = self.stack[self.Iterator]
self.Iterator = self.Iterator - 1 # update for the next step
return current_value
else: # stop if self.Iterator is -1
raise StopIteration
答案 1 :(得分:0)
由于您是list
来存储堆栈元素,因此可以使用python的iter
函数返回迭代器并使用它。
class Stack:
def __init__(self):
self.stack = []
def push(self, item):
self.stack.append(item)
#print("item added to stack")
def pop(self):
return self.stack.pop()
#print("value removed according to LIFO")
def emptystack(self):
return len(self.stack) == 0
def stack_iter(self):
return iter(self.stack)
def stack_iter_next(self, iterator):
return next(self.Iterator)
def fullstack(self):
return self.stack
s = Stack()
s.push('1')
s.push('2')
s.push('6')
s.push('8')
s.push('11')
s.push('12')
s.pop()
s.push('50')
s_iter = s.stack_iter()
for x in s_iter:
print (x)