我編寫了此程序以相反順序在列表中打印元素。它給了我正確的答案,但答案後顯示了另一個錯誤。 我的代碼有什麼問題?使用堆棧以相反順序寫入列表時出錯
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