栈（stack）是先进后出结构

使用Python list 或者 collectionsdeque实现栈的先进后出

from collections import deque

class Stack:

    def __init__(self):
        self.deque = deque()

    def push(self, value):
        return self.deque.append(value)

    def pop(self):
        return self.deque.pop()

    def empty(self):
        return len(self.deque) == 0


def test_stack():
    q = Stack()
    q.push(0)
    q.push(1)
    q.push(3)
    q.empty()

    print(q.pop())


test_stack()