通过列表的pop方法(删除一个列表元素并且将这个列表元素返回给调用者)和append(在列表后面追加一个元素)的结合,可以实现堆栈操作,pop()可以返回一个列表中的最后一个元素,通过定义一个count用来计数,用来记录入栈的元素个数,防止栈溢出或者出栈一个空列表。
class Stack():
def __init__(self, size):
self.size = size
self.count = 0
self.stack = []
def push(self,one):
if self.isFull():
raise print('stack is full')
return
self.stack.append(one)
self.count += 1
return
def pop(self):
if self.isEmpty():
raise print('stack is empty')
return
self.stack.pop()
self.count -= 1
return
def isFull(self):
return self.count == self.size
def isEmpty(self):
return self.count == 0
def showStatus(self):
print(self.stack)
s = Stack(10)
for i in range(10):
s.push(i)
s.showStatus()
for i in range(10):
s.pop()
s.showStatus()
运行结果:
[0]
[0, 1]
[0, 1, 2]
[0, 1, 2, 3]
[0, 1, 2, 3, 4]
[0, 1, 2, 3, 4, 5]
[0, 1, 2, 3, 4, 5, 6]
[0, 1, 2, 3, 4, 5, 6, 7]
[0, 1, 2, 3, 4, 5, 6, 7, 8]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
[0, 1, 2, 3, 4, 5, 6, 7, 8]
[0, 1, 2, 3, 4, 5, 6, 7]
[0, 1, 2, 3, 4, 5, 6]
[0, 1, 2, 3, 4, 5]
[0, 1, 2, 3, 4]
[0, 1, 2, 3]
[0, 1, 2]
[0, 1]
[0]
[]