<p>我正在创建一个具有以下功能的堆栈演示:</p>
<pre><code>( 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
</code></pre>
<p>我正在做的代码</p>
<pre><code> class Stack(object) :
def __init__(self) :
self.items = []
def push(self, item) :
self.items.<a href="https://www.cnpython.com/list/append" class="inner-link">append</a>(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
</code></pre>
<p>有人知道怎么做吗?</p>
<p>谢谢</p>