面向对象堆栈及队列的实现

堆栈：

class Stack(object):
    def __init__(self, stack):
        self.stack = stack

    def push(self, item):
        self.stack.append(item)

    def manyPush(self, *args):
        self.stack.extend(args)

    def pop(self):
        if not self.isEmpty():
            return self.stack.pop(-1)
        else:
            return None

    def stack_top(self):
        if not self.stack == []:
            return self.stack[-1]
        else:
            return None

    def show(self):
        for i in self.stack:
            print i,

    def length(self):
        return len(self.stack)

    def isEmpty(self):
        return self.stack == []

队列：

class Queue(object):
    def __init__(self,queue):
        print "queue is createing....."
        self.queue = queue

    def enqueue(self, item):
        self.queue.append(item)

    def manyEnQueue(self, *args):
        self.queue.extend(args)

    def outqueue(self):
        if not self.queue == []:
            return self.queue.pop(0)
        else:
            return None

    def show(self):
        for i in self.queue:
            print i,

    def head(self):
        if not self.queue == []:
            return self.queue[0]
        else:
            return None

    def tail(self):
        if not self.queue == []:
            return self.queue[-1]
        else:
            return None

    def length(self):
        return len(self.queue)

    def isEmpty(self):
        return self.queue == []

    def __del__(self):
        print "queue is deleteing...."