Question

我正在创建一个具有某些功能的堆栈演示：

( Method ) __init__(self, n) => How can I initial the fix  n len of stack. ?
( Method ) IsEmpty      => Done by using lists as stacks 
( Method ) IsFull       => Done by using lists as stacks 
( Method ) Push         => Done by using lists as stacks 
( Method ) Pop          => Done by using lists as stacks

我正在做的代码

 class Stack(object) :

   def __init__(self) :
    self.items = []
   def push(self, item) :
    self.items.append(item)

   def pop(self) :
    return self.items.pop()

   def isEmpty(self) :
    return (self.items == []) 

if __name__ == "__main__":
    demoStack = Stack()
    demoStack.push(1)
    print demoStack.items

Anyboday知道这样做吗？

感谢

Answer 1

在python中查看Using lists as stacks。

Answer 2

Python的列表可能已经拥有了你想要的一切。如果你想要一些额外的功能，比如限制最大数量的对象，你应该将它子类化，或者用另一个类包围它。

Answer 3

Python内置了它，请参阅Using Lists as Stacks。听起来你也可以从Python Tutorial中受益。

Answer 4

>>> stack = []
>>> print stack
[1, 2, 3, 4, 5, 6, 7, 8, 9]
>>> val = stack.pop()
>>> print stack
[1, 2, 3, 4, 5, 6, 7, 8]
>>> val
9
>>>

通过使用列表作为堆栈在python中实现堆栈

4 个答案: