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).
方法一:定义两个队列q1、q2;
push():将值压入q1中;
pop():将q1的值逐个转移到q2中直到q1中只剩一个数值,最后删除q1中仅剩的元素,并将q2中的值全部转移到q1中;
top():同理pop;
empty():判断两个队列是否全部为空;
class Stack {
public:
queue<int> q1;
queue<int> q2;
// Push element x onto stack.
void push(int x) {
q1.push(x);
}
// Removes the element on top of the stack.
void pop() {
while(q1.size() > 1)
{
q2.push(q1.front());
q1.pop();
}
q1.pop();
while(q2.size() > 0)
{
q1.push(q2.front());
q2.pop();
}
}
// Get the top element.
int top() {
while(q1.size() > 1)
{
q2.push(q1.front());
q1.pop();
}
return q1.front();
}
// Return whether the stack is empty.
bool empty() {
return
2.empty()&&q1.empty();
}
};
方法2:
push():将如果要在q1中插入数值,则先将q1中的数值全部转移到q2中,之后将数值插入空q1中,再将q2中的全部数值转移到1中;(比如先将1插入队a中 ,现在要将2入栈,则将2插入b总然后将a中的1出列入到b中,b中的元素变为 2 ,1;
a为空,现在要压入3 则将3插入a中 ,依次将b中的2 ,1 出列并加入倒a中 ,a中的元素变为 3,2,1 b为空;
算法保证在任何时候都有一队列为)
)
其他的pop、top、empty就如普通对栈的操作;
(对非空的队列进行操作)
class Stack {
public:
queue<int> q1;
queue<int> q2;
// Push element x onto stack.
void push(int x) {
if(q1.empty())
{
q1.push(x);
while(!q2.empty())
{
int e = q2.front();
q2.pop();
q1.push(e);
}
}
else
{
q2.push(x);
while(!q1.empty())
{
int e = q1.front();
q1.pop();
q2.push(e);
}
}
}
// Removes the element on top of the stack.
void pop() {
if(!q1.empty())
q1.pop();
if(!q2.empty())
q2.pop();
}
// Get the top element.
int top() {
if(!q1.empty())
return q1.front();
if(!q2.empty())
return q2.front();
}
// Return whether the stack is empty.
bool empty() {
return q2.empty()&&q1.empty();
}
};