题目链接
https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/
描述
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部
插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
提示:
1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调用
示例
示例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> stack;
Deque<Integer> help;
public CQueue() {
stack = new LinkedList<>();
help = new LinkedList<>();
}
public void appendTail(int value) {
stack.push(value);
}
public int deleteHead() {
if (help.isEmpty()) {
if (stack.isEmpty()) {
return -1;
}
while (!stack.isEmpty()) {
help.push(stack.pop());
}
}
return help.pop();
}
}