第3章 栈和队列(2)

Python写一个利用列表[]实现栈的代码：

class Stack:
    """Stack class in Stack.py"""
    def __init__(self,size):
        self.__maxsize=size
        self.__data=[]
        self.__top=-1
    def __getitem__(self,index):
        return self.__data[index]
    
    def __setitem__(self,index,value):
        self.__data[index]=value
        
    def GetLength(self):
        return self.__top+1
    
    def Clear(self):
        self.__top=-1
    
    def IsEmpty(self):
        if self.__top==-1:
            return True
        else:
            return False

    def IsFull(self):
        if self.__top==self.__maxsize-1:
            return True
        else:
            return False
        
    def Push(self,item):
        if(self.IsFull()):
            print "Stack is full"
            return
        self.__top+=1
        self.__data.append(item)
    
    def Pop(self):
        if(self.IsEmpty()):
            print "Stack is empty"
        tmp=self.__data[self.__top]
        self.__top-=1
        return tmp
    
    def GetTop(self):
        if self.IsEmpty():
            print "Stack is empty"
        else:
            return data[self.__top]

"Program.py"
from Node import Node
from LinkList import LinkList 
from Stack import Stack

stack=Stack(100)

for i in range(0,100):
    stack.Push(i)

for i in range(0,100):
    print stack.Pop()," "