手撕栈(顺序表)
类的说明
创建空斩__init__
判断是否为空is_empty
压push
出pop
取出压入的元素top
class Stack():
def __init__(self):
self.item = []
def is_empty(self):
return self.item == []
def push(self,elem):
self.item.append(elem)
def pop(self):
if self.item == []:
raise StackUnderflow("at top")
self.item.pop()
def top(self):
if slef.item == []
raise StackUnderflow("at top")
return self.item[-1]