232. 用栈实现队列
问题
使用栈实现队列的下列操作:
- push(x) – 将一个元素放入队列的尾部。
- pop() – 从队列首部移除元素。
- peek() – 返回队列首部的元素。
- empty() – 返回队列是否为空。
示例:
MyQueue queue = new MyQueue(); queue.push(1); queue.push(2); queue.peek(); // 返回 1 queue.pop(); // 返回 1 queue.empty(); // 返回 false
思路
两个栈,入队的时候进入第一个栈,出队的时判断第二个栈是否为空,若未空则将第一个栈数据出栈进入第二个栈中。
import java.util.*;
class MyQueue {
Stack<Integer> enStack=new Stack<>();
Stack<Integer> deStack=new Stack<>();
/** Initialize your data structure here. */
public MyQueue() {
}
/** Push element x to the back of queue. */
public void push(int x) {
enStack.push(x);
}
/** Removes the element from in front of queue and returns that element. */
public int pop() {
if(enStack.isEmpty()
&&deStack.isEmpty())
return -1;
if(deStack.isEmpty()) {
while(!enStack.isEmpty()) {
deStack.push(enStack.pop());
}
}
return deStack.pop();
}
/** Get the front element. */
public int peek() {
if(enStack.isEmpty()
&&deStack.isEmpty())
return -1;
if(deStack.isEmpty()) {
while(!enStack.isEmpty()) {
deStack.push(enStack.pop());
}
}
return deStack.peek();
}
/** Returns whether the queue is empty. */
public boolean empty() {
if(enStack.isEmpty()
&&deStack.isEmpty())
return true;
return false;
}
}
/**
* 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();
*/