Python实现栈

# -*- coding:utf-8 -*-

class Stack():

 #初始化栈，并给定栈的大小

 def __init__(self,size):

  self.stack=[]

  self.size=size

  self.top=-1

 #判断栈是否满了，栈满返回True

 def Full(self):

  if self.top==(self.size-1):

   return True

  else:

   return False

 #判断栈是否为空，为空返回True

 def Empty(self):

  if self.top==-1:

   return True

  else:

   return False

 #入栈

 def stackin(self,content):

  if self.Full():

   print 'The stack is full!'

  else:

   self.stack.append(content)

   self.top+=1

 #出栈

 def stackout(self):

  if self.Empty():

   print 'The stack is empty!'

   return None

  else:

   content=self.stack[self.top]

   self.stack.pop(self.top)

   self.top-=1

   return content

 #遍历栈

 def stackall(self):

  if self.Empty():

   print 'The stack is Empty!'

  else:

   while self.top>=0:

    print self.stack[self.top]

    self.top-=1