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).
熟悉stack和queue的操作
stack:
top()
pop()
empty()
push(int x);
queue:
push(int x);
empty();
pop();
peek();
class Queue {
public:
stack<int> s1;
stack<int> s2;
// Push element x to the back of queue.
void push(int x) {
s1.push(x);
}
// Removes the element from in front of queue.
void pop(void) {
if(s2.empty())
{
while(!s1.empty())
{
int x=s1.top();
s1.pop();
s2.push(x);
}
s2.pop();
}
else
s2.pop();
}
// Get the front element.
int peek(void) {
if(s2.empty())
{
while(!s1.empty())
{
int x=s1.top();
s1.pop();
s2.push(x);
}
return s2.top();
}
else
return s2.top();
}
// Return whether the queue is empty.
bool empty(void) {
return(s1.empty() && s2.empty());
}
};