from collections import deque
classMyStack(object):def__init__(self):
self.que =[]defpush(self, x):"""
:type x: int
:rtype: None
"""
self.que.append(x)defpop(self):"""
:rtype: int
"""# 弹出栈顶,即队尾,依次把前n-1个元素弹出再重新加入到队列中
n =len(self.que)
n -=1while n >0:
self.que.append(self.que.pop(0))
n -=1return self.que.pop(0)deftop(self):"""
:rtype: int
"""return self.que[-1]defempty(self):"""
:rtype: bool
"""return self.que ==[]# Your MyStack object will be instantiated and called as such:# obj = MyStack()# obj.push(x)# param_2 = obj.pop()# param_3 = obj.top()# param_4 = obj.empty()