题目
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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]
提示:
1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调用
思路
元素入栈后压入栈底,把栈A元素按顺序压到栈B中,则栈B移动顶部元素就可以达到删除队首的效果
代码
class CQueue {
LinkedList<Integer> A,B;
public CQueue(){
A = new LinkedList<Integer>();
B = new LinkedList<Integer>();
}
public void appendTail(int value){
A.addLast(value);
}
public int deleteHead(){
if(!B.isEmpty() ) return B.removeLast();
if(A.isEmpty()) return -1;
while (!A.isEmpty()){
B.addLast(A.removeLast());
}
return B.removeLast();
}
}