题目链接:https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/
题目描述:
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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 {
//声明全局变量
Deque<Integer> stack1;
Deque<Integer> stack2;
//初始化
public CQueue() {
stack1 = new LinkedList<Integer>();
stack2 = new LinkedList<Integer>();
}
//由stack1来维护插入
public void appendTail(int value) {
stack1.offerFirst(value);
}
//由stack2来维护删除
public int deleteHead() {
//如果stack2非空,直接从stack2中出栈即可
if(!stack2.isEmpty()) {
return stack2.pollFirst();
}
//如果stack1和stack2都为空,则说明队列中没有元素,返回-1
if(stack1.isEmpty()) {
return -1;
}
//如果stack1不为空,stack2为空,则将stack1中元素全部出栈放入stack2中
while(!stack1.isEmpty()) {
stack2.offerFirst(stack1.pollFirst());
}
//再从stack2中出栈,返回其值。
return stack2.pollFirst();
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/