[剑指 Offer 09. 用两个栈实现队列]
难度 简单
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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 次调用
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof
解法:
class CQueue {
Stack<Integer> A; //A 的栈顶为队尾
Stack<Integer> B; //B 的栈顶为队首
public CQueue() {
this.A = new Stack<Integer>();
this.B = new Stack<Integer>();
}
public void appendTail(int value) {
A.push(value);
}
public int deleteHead() {
//如果 B 不为空,则返回栈顶元素
if(!B.isEmpty()) {
return B.pop();
}
//将 A 的元素全部弹出到 B 中
while(!A.isEmpty()) {
B.push(A.pop());
}
if(B.isEmpty()) {
return -1;
}else {
return B.pop();
}
}
}