使用队列实现堆栈的以下操作。
- push(x)-将元素x推入堆栈
- pop()-删除堆栈顶部的元素。
- top()-获取顶部元素。
- empty()-返回堆栈是否为空。
和170设计两个数加和的函数类似
class MyStack:
def __init__(self):
"""
Initialize your data structure here.
"""
self.queue=[]
def push(self, x: int) -> None:
"""
Push element x onto stack.
"""
self.queue.append(x)
def pop(self) -> int:
"""
Removes the element on top of the stack and returns that element.
"""
return self.queue.pop()
def top(self) -> int:
"""
Get the top element.
"""
return self.queue[-1]
def empty(self) -> bool:
"""
Returns whether the stack is empty.
"""
return len(self.queue)==0
# 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()
在empty中我先试了return self.queue is None, 但是当
Input: ['MyStack','empty'] [[],[]]
Output: null false
也不知道为什么= =就变成判断长度是否为0了