题目:
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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 次调用
题解:
class CQueue {
Stack<Integer> stk1;
Stack<Integer> stk2;
public CQueue() {
stk1 = new Stack();
stk2 = new Stack();
}
public void appendTail(int value) {
//用栈1存储value
stk1.push(value);
}
public int deleteHead() {
//如果栈2是空
if(stk2.isEmpty()) {
//只要栈1不为空,就不栈1的所有元素放到栈2
while(!stk1.isEmpty()) {
stk2.push(stk1.pop());
}
}
//如果栈2为空
if(stk2.isEmpty()){
return -1;
} else {
//栈2不为空,出栈
return stk2.pop();
}
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/