用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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 {
Deque<Integer> stack1,stack2;
public CQueue() {
stack1 = new LinkedList<Integer>();//向上转型
stack2 = new LinkedList<Integer>();
}
public void appendTail(int value) {
stack1.push(value);//压入栈1
}
public int deleteHead() {
if(stack1.isEmpty() && stack2.isEmpty()){//队列没有元素可以弹出
return -1;
}
if(stack2.isEmpty()){//缓冲栈2若为空,则将栈1中的全部元素弹入栈2中
while(!stack1.isEmpty()){
stack2.push(stack1.pop());
}
}
return stack2.pop();//经过两次的FILO,也就变成了FIFO了。
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/