Python常见数据结构-栈
首先,栈是一种数据结构。具有后进先出特性。
#栈的实现
class Stack():
def __init__(self,size):
self.stack=[]
self.size=size
self.top=-1
def push(self,content):
if self.Full():
print "Stack is Full"
else:
self.stack.append(content)
self.top=self.top+1
def out(self):
if self.Empty():
print "Stack is Empty"
else:
self.top-=1
def Full(self):
if self.top==self.size-1:
return True
else:
return False
def Empty(self):
if self.top==-1:
print "Stack is Empty"
if __name__=="__main__":
q=Stack(7)
q.Empty()
q.push("hello")
q.Empty()