一、题目要求
Implement the following operations of a stack using queues.
push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
empty() -- Return whether the stack is empty.
Notes:
You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
二、代码实现
// Push element x onto stack.
void push(int x) {
if(first.empty()&&second.empty())
{
first.push(x);
}
else if(!first.empty())
{
first.push(x);
}
else if(!second.empty())
{
second.push(x);
}
}
// Removes the element on top of the stack.
void pop() {
if(first.empty())
{
if(second.empty())
return;
else
{
while(1)
{
int tmp=second.front();
second.pop();
if(!second.empty())
{
first.push(tmp);
}
else
break;
}
}
}
else
{
if(first.empty())
return;
else
{
while(1)
{
int tmp=first.front();
first.pop();
if(!first.empty())
{
second.push(tmp);
}
else
break;
}
}
}
}
// Get the top element.
int top() {
if(first.empty())
{
if(second.empty())
return -1;
else
{
int tmp;
while(!second.empty())
{
tmp=second.front();
first.push(tmp);
second.pop();
}
return tmp;
}
}
else
{
if(first.empty())
return -1;
else
{
int tmp;
while(!first.empty())
{
tmp=first.front();
second.push(tmp);
first.pop();
}
return tmp;
}
}
}
// Return whether the stack is empty.
bool empty() {
if(first.empty()&&second.empty())
return true;
return false;
}
private:
queue<int> first,second;