需求:
队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,
分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
示例 1:
输入:
["CQueue","appendTail","deleteHead","deleteHead","deleteHead"]
[[],[3],[],[],[]]
输出:[null,null,3,-1,-1]
示例 2:
输入:
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出:[null,-1,null,null,5,2]
提示:
1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调
代码实现1
class CQueue {
//数据栈
Stack<Integer> stack1;
//辅助栈
Stack<Integer> stack2;
public CQueue() {
stack1 = new Stack<>();
stack2 = new Stack<>();
}
//入队
public void appendTail(int value) {
//把数据栈中数据全部放入辅助栈
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
//将value入到数据栈
stack1.push(value);
//将辅助栈的元素重新放回数据栈
while (!stack2.isEmpty()) {
stack1.push(stack2.pop());
}
}
//出队
public int deleteHead() {
if (stack1.isEmpty()) {
return -1;
} else {
return stack1.pop();
}
}
}
代码实现2
public class CQueue {
//添加栈
Stack<Integer> add;
//删除栈
Stack<Integer> remove;
public CQueue() {
add = new Stack<>();
remove = new Stack<>();
}
//入队
public void appendTail(int value) {
while (!remove.isEmpty()) {
add.push(remove.pop());
}
add.push(value);
}
//出队
public int deleteHead() {
if (remove.isEmpty() && add.isEmpty()) return -1;
while (!add.isEmpty()) {
remove.push(add.pop());
}
return remove.pop();
}
}
代码实现3
public class CQueue {
Stack<Integer> add;
Stack<Integer> remove;
public CQueue() {
add = new Stack<>();
remove = new Stack<>();
}
//入队
public void appendTail(int value) {
add.push(value);
}
//出队
public int deleteHead() {
if (remove.isEmpty() && add.isEmpty()) return -1;
if (!remove.isEmpty()) {
return remove.pop();
}
while (!add.isEmpty()) {
remove.push(add.pop());
}
return remove.pop();
}
}