题目
请用栈实现一个队列,支持如下四种操作:
push(x) – 将元素x插到队尾;
pop() – 将队首的元素弹出,并返回该元素;
peek() – 返回队首元素;
empty() – 返回队列是否为空;
注意:
你只能使用栈的标准操作:push to top,peek/pop from top, size 和 is empty;
如果你选择的编程语言没有栈的标准库,你可以使用list或者deque等模拟栈的操作;
输入数据保证合法,例如,在队列为空时,不会进行pop或者peek等操作;
样例
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false
算法
class MyQueue {
/** Initialize your data structure here. */
Stack<Integer> stack1 = new Stack();
Stack<Integer> stack2 = new Stack();
public MyQueue() {
}
/** Push element x to the back of queue. */
public void push(int x) {
stack1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
public int pop() {
if(!stack2.empty()){
int res = stack2.peek();
stack2.pop();
return res;
}else{
while(!stack1.empty()){
stack2.push(stack1.peek());
stack1.pop();
}
int res = stack2.peek();
stack2.pop();
return res;
}
}
/** Get the front element. */
public int peek() {
if(!stack2.empty())
return stack2.peek();
else{
while(!stack1.empty()){
stack2.push(stack1.peek());
stack1.pop();
}
return stack2.peek();
}
}
/** Returns whether the queue is empty. */
public boolean empty() {
return stack1.empty() && stack2.empty();
}
}