请用栈实现一个队列,支持如下四种操作:
- 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 {
private Stack<Integer> stk,cache;
/** Initialize your data structure here. */
public MyQueue() {
stk = new Stack();
cache = new Stack();
}
/** Push element x to the back of queue. */
public void push(int x) {
stk.push(x);
}
/** Removes the element from in front of queue and returns that element. */
public int pop() {
copy(stk,cache);
int res = cache.pop();
copy(cache,stk);
return res;
}
/** Get the front element. */
public int peek() {
copy(stk,cache);
int res = cache.peek();
copy(cache,stk);
return res;
}
/** Returns whether the queue is empty. */
public boolean empty() {
return stk.isEmpty();
}
private void copy(Stack<Integer> origin,Stack<Integer>cpy){
while(!origin.isEmpty()){
cpy.push(origin.pop());
}
}
}
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue obj = new MyQueue();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.peek();
* boolean param_4 = obj.empty();
*/