基础数据结构 之 队列（python实现）

class Queue(object):
def __init__(self, size = 8):
self.queue = []
self.size = size
self.front = 0
self.rear = -1

def isFull(self):
return True if self.rear == self.size - 1 else False

def isEmpty(self):
return True if self.rear == -1 else False

def push(self, data):
if self.isFull():
raise Exception("QueueOverFlow")
self.queue.append(data)
self.rear += 1

def pop(self):
if self.isEmpty():
raise Exception("QueueIsEmpty")
self.rear -= 1
return self.queue.pop(self.front)

def first(self):
return self.queue[self.front]

def last(self):
return self.queue[self.rear]

def show(self):
print self.queue