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.
- 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).
class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
if (primaryStack.empty()) {
primaryStack.push(x);
} else {
while (!primaryStack.empty()) {
helperStack.push(primaryStack.top());
primaryStack.pop();
}
primaryStack.push(x);
while (!helperStack.empty()) {
primaryStack.push(helperStack.top());
helperStack.pop();
}
}
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
int result = peek();
primaryStack.pop();
return result;
}
/** Get the front element. */
int peek() {
return primaryStack.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return primaryStack.empty();
}
private:
stack<int> primaryStack;
stack<int> helperStack;
};
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue obj = new MyQueue();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.peek();
* bool param_4 = obj.empty();
*/
同样AC。