我编写了此程序以相反顺序在列表中打印元素。它给了我正确的答案,但答案后显示了另一个错误。 我的代码有什么问题?使用堆栈以相反顺序写入列表时出错
Stack类
class Stack:
def __init__(self):
self.items=[]
def isEmpty(self):
return self.items==[]
def push(self,data):
self.items.append(data)
def size(self):
return len(Self.items)
def show(self):
print (self.items)
def peek(self):
return self.items[len(self.items)-1]
def pop(self):
assert not self.isEmpty()
return self.items.pop()
计划
def reverseOrder():
lista = [1,4,6,7,8,9]
s = Stack()
for i in lista:
s.push(i)
while s.isEmpty:
print(s.pop())
reverseOrder()
和下面是我的输出:
>>>
RESTART: C:/Users/Dil/AppData/Local/Programs/Python/Python36-32/Tutorials/reverseOrder.py
9
8
7
6
4
1
Traceback (most recent call last):
File "C:/Users/Dil/AppData/Local/Programs/Python/Python36-32/Tutorials/reverseOrder.py", line 35, in <module>
reverseOrder();
File "C:/Users/Dil/AppData/Local/Programs/Python/Python36-32/Tutorials/reverseOrder.py", line 33, in reverseOrder
print(s.pop());
File "C:/Users/Dil/AppData/Local/Programs/Python/Python36-32/Tutorials/reverseOrder.py", line 21, in pop
assert not self.isEmpty()
AssertionError
>>>
'while s.isEmpty' must be'while not s.isEmpty()'。调用你的功能!并且不要使用分号。 – DyZ
不,那么它根本没有给我输出..在那里我正在检查一个条件。所以它应该s.isEmpty只有我认为 – dilk