Implement Queue using Stacks
Question
Implement the following operations of a queue using stacks.
- push(x) -- Push element x to the back of queue.
- pop() -- Removes the element from in front of queue.
- peek() -- Get the front element.
- empty() -- Return whether the queue is empty.
Notes:
- You must use only standard operations of a stack -- which means only
push to top
,peek/pop from top
,size
, andis empty
operations are valid. - Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
- You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
Tags
- Stack
Thought
Use two stacks to mimic the queue. One stack is used to store the new items and the other stack is used for pop.
Code
class MyQueue(object):
def __init__(self):
"""
Initialize your data structure here.
"""
self.inStack = []
self.outStack = []
def push(self, x):
"""
Push element x to the back of queue.
:type x: int
:rtype: void
"""
self.inStack.append(x)
def pop(self):
"""
Removes the element from in front of queue and returns that element.
:rtype: int
"""
self.move()
return self.outStack.pop()
def peek(self):
"""
Get the front element.
:rtype: int
"""
self.move()
return self.outStack[-1]
def empty(self):
"""
Returns whether the queue is empty.
:rtype: bool
"""
return (self.inStack == []) and (self.outStack == [])
def move(self):
"""
Move the items from inStack to outStack
"""
if self.outStack == []:
while self.inStack:
self.outStack.append(self.inStack.pop())
# 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()