标签:structure -- use size ini instant sim append returns
Implement the following operations of a queue using stacks.
Example:
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false
Notes:
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.queue = []
def push(self, x):
"""
Push element x to the back of queue.
:type x: int
:rtype: void
"""
self.queue.append(x)
return
def pop(self):
"""
Removes the element from in front of queue and returns that element.
:rtype: int
"""
return self.queue.pop(0)
def peek(self):
"""
Get the front element.
:rtype: int
"""
return self.queue[0]
def empty(self):
"""
Returns whether the queue is empty.
:rtype: bool
"""
return len(self.queue)==0
# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()
232.Implement Queue using Stacks
标签:structure -- use size ini instant sim append returns
原文地址:https://www.cnblogs.com/bernieloveslife/p/9771775.html