1. 题目描述
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).
使用队列实现栈。只能使用队列中的基本方法包括add()offer()/element()peek()/remove()poll()。
2. 解题思路
一开始觉得应该和[232] Implement Queue using Stacks差不多,使用两个队列翻转一下就可以了,后来仔细一想,不对,栈因为后进先出的特性,通过两个栈就可以进行翻转,使用两个队列进行一次操作是无法将队列翻转过来的。如[1,2,3]出队到另一个队列还是[1,2,3]。那么就只能使用两个队列来回倒腾的方式了,队列中其中一个队列负责push,当进行一次pop时,将这个队列中除最后一个元素的所有元素移动到另一个队列中,剩下的最后一个pop,并且切换责任,使另一个队列作为接受push的主队列。过程如下图所示:
3. Code
import java.util.Queue;
import java.util.LinkedList;
class MyStack {
Queue<Integer> queue1 = new LinkedList<>();
Queue<Integer> queue2 = new LinkedList<>();
int mainQueue = 1;
// Push element x onto stack.
public void push(int x) {
if(mainQueue == 1){
queue1.offer(x);
}
else
{
queue2.offer(x);
}
}
// Removes the element on top of the stack.
public void pop() {
if(mainQueue == 1)
{
move12();
mainQueue = 2;
queue1.poll();
}
else
{
move21();
mainQueue = 1;
queue2.poll();
}
}
// Get the top element.
public int top() {
if(mainQueue == 1)
{
move12();
return queue1.peek();
}
else
{
move21();
return queue2.peek();
}
}
// Return whether the stack is empty.
public boolean empty() {
return queue1.isEmpty() && queue2.isEmpty();
}
private void move12()
{
// 转移queue1到queue2,保留一个元素
while(queue1.size() > 1)
{
queue2.offer(queue1.poll());
}
}
private void move21()
{
// 转移queue2到queue1,保留一个元素
while(queue2.size() > 1)
{
queue1.offer(queue2.poll());
}
}
}