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 Queue {
public:
stack<int> que;
stack<int> temp;
// Push element x to the back of queue.
void push(int x) {
while(!que.empty())
{
temp.push(que.top());
que.pop();
}
que.push(x);
while(!temp.empty())
{
que.push(temp.top());
temp.pop();
}
}
// Removes the element from in front of queue.
void pop(void) {
que.pop();
}
// Get the front element.
int peek(void) {
return que.top();
}
// Return whether the queue is empty.
bool empty(void) {
return que.empty();
}
};
法二:笨办法,每次要pop或者要top,就整个放到另一个栈中,做完之后再放回原栈当中
class Queue {
public:
stack<int> que;
stack<int> temp;
// Push element x to the back of queue.
void push(int x) {
que.push(x);
}
// Removes the element from in front of queue.
void pop(void) {
while(!que.empty())
{
temp.push(que.top());
que.pop();
}
temp.pop();
while(!temp.empty())
{
que.push(temp.top());
temp.pop();
}
}
// Get the front element.
int peek(void) {
while(!que.empty())
{
temp.push(que.top());
que.pop();
}
int tem = temp.top();
while(!temp.empty())
{
que.push(temp.top());
temp.pop();
}
return tem;
}
// Return whether the queue is empty.
bool empty(void) {
return que.empty()&&temp.empty();
}
};