class MyQueue {
Deque<Integer> inStack;
Deque<Integer> outStack;
public MyQueue() {
inStack = new ArrayDeque<Integer>();
outStack = new ArrayDeque<Integer>();
}
public void push(int x) {//入栈操作
inStack.push(x);
}
public int pop() { //如果输出栈为空,则in2out,即从输入栈进入元素至输出栈。
if (outStack.isEmpty()) {
in2out();
}
return outStack.pop();//再用pop 即队列的操作
}
public int peek() {
if (outStack.isEmpty()) { //如果输出栈为空,则in2out,即从输入栈进入元素至输出栈。
in2out();
}
return outStack.peek();//返回队列开头的元素
}
public boolean empty() {
return inStack.isEmpty() && outStack.isEmpty();
}
private void in2out() {//当输入不为空的时候,将输入栈的元素压入输出栈
while (!inStack.isEmpty()) {
outStack.push(inStack.pop());
}
}
}