栈的特点: 现金后出 LIFO
和队列正好是相反的
class Stack(object):
def __init__(self):
self._deque = EeQue()
def push(self,value):
return self._deque.push(value)
def pop(self):
return self._deque.pop()
def is_empty(self):
return len(self._deque) == 0