正如题目所说的,利用栈来实现队列
但是栈是后进先出,队列是先进先出,怎么才能用栈实现队列呢?
答案是:用两个栈来实现一个队列
- 先定义一个inStack和一个outStack
- 进队的元素都push进inStack里
- 出队时,判断outStack是否为空,如果空,则将inStack中元素全部pop出来,再依次push进outStack
- 说到这里,其实就是负负得正,需要出队元素的优先级,outStack栈顶–>outStack栈底–>inStack栈底–>inStack栈顶
- 队列为空时,inStack和outStack都要为空
private Stack<Integer> inStack = new Stack<>();
private Stack<Integer> outStack = new Stack<>();
public MyQueue() {
}
public void push(int x) {
inStack.push(x);
}
public int pop() {
if (outStack.isEmpty()){
while (!inStack.isEmpty()) outStack.push(inStack.pop());
}
return outStack.pop();
}
public int peek() {
if (outStack.isEmpty()){
while (!inStack.isEmpty()) outStack.push(inStack.pop());
}
return outStack.peek();
}
public boolean empty() {
return inStack.isEmpty()&&outStack.isEmpty();
}