用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
示例 1:
输入:
[“CQueue”,“appendTail”,“deleteHead”,“deleteHead”]
[[],[3],[],[]]
输出:[null,null,3,-1]
示例 2:
输入:
[“CQueue”,“deleteHead”,“appendTail”,“appendTail”,“deleteHead”,“deleteHead”]
[[],[],[5],[2],[],[]]
输出:[null,-1,null,null,5,2]
class CQueue {
public Stack<Integer> stackpush;
public Stack<Integer> stackpop;
public CQueue() {
stackpush = new Stack<Integer>();
stackpop = new Stack<Integer>();
}
private void pushtopop(){
if(stackpop.isEmpty()){
while(!stackpush.isEmpty()){
stackpop.push(stackpush.pop());
}
}
}
public void appendTail(int value) {
stackpush.push(value);
pushtopop();
}
public int deleteHead() {
if(stackpop.empty()&&stackpush.empty()){
stackpop.push(-1);
}
pushtopop();
return stackpop.pop();
}
}