栈的使用方法

定义一个顺序栈

class SqStack(object):
def init(self,max):
self.max = max
self.top = -1
sel.stack = [None for i in range(self.max)]

判断栈是否为空

def empty(self):
return self.top is -1

栈顶推入新元素

def push(self,val):
newNone = Node(val)
newNode.next = self.top
self.top = newNode

读取栈顶元素并弹出

def peek(self):
if self.empty():
raise IndexError
else:
return self.stack[self.top]
if name== “main”:
s = SeqStack(8)
for i in range(0,5):
s.push(i)
print(s.peek())
s.pop()
print(s.peek())
s.push(8)
s.push(9)