栈与队列

queue.py

#coding: utf-8

class Queue(object):
    '''队列'''

    def __init__(self):
        self._queue=[]

    def enqueue(self,item):
        '''进队列'''
        self._queue.append(item)

    def dequeue(self):
        '''出队列'''
        print(self._queue.pop(0))

    def is_empty(self):
        return self._queue == []

    def size(self):
        return len(self._queue)

if __name__ == "__main__":
    q = Queue()
    q.enqueue(1)
    q.enqueue(2)
    q.enqueue(3)
    q.enqueue(4)
    q.dequeue()
    q.dequeue()
    q.dequeue()
    q.dequeue()

 

dqueue.py

# coding: utf-8

class DQueue(object):
    '''队列'''

    def __init__(self):
        self._dqueue = []

    def add_front(self, item):
        '''进队列'''
        self._dqueue.insert(0, item)

    def add_rear(self, item):
        '''进队列'''
        self._dqueue.append(item)

    def pop_front(self):
        '''出队列'''
        print(self._dqueue.pop(0))

    def pop_rear(self):
        '''出队列'''
        print(self._dqueue.pop())

    def is_empty(self):
        return self._dqueue == []

    def size(self):
        return len(self._dqueue)


if __name__ == "__main__":
    q = DQueue()

 

stack.py

#coding: utf-8

class Stack(object):

    def __init__(self):
        self._list=[]

    def push(self,item):
        '''入栈'''
        self._list.append(item)

    def pop(self):
        '''出栈'''
        return self._list.pop()

    def peek(self):
        '''返回栈顶元素'''
        if self._list:
            return self._list[-1]
        else:
            return

    def is_empty(self):
        return self._list == []

    def size(self):
        '''返回栈的元素个数'''
        return len(self._list)

if __name__  == "__main__":
    s=Stack()
    s.push(1)
    s.push(2)
    s.push(3)
    s.push(4)
    print(s.pop())
    print(s.pop())
    print(s.pop())
    print(s.pop())