用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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]
代码实现:
class CQueue {
private Stack<Integer> in;
private Stack<Integer> out;
public CQueue() {
in = new Stack<>();
out = new Stack<>();
}
public void appendTail(int value) {
while(!out.isEmpty()){
in.push(out.pop());
}
in.push(value);
}
public int deleteHead() {
while(!in.isEmpty()){
out.push(in.pop());
}
if(out.isEmpty()){
return -1;
}
return out.pop();
}
}
思路:就是创建两个栈,因为栈的特性是先进后出,所以要想模拟队列(先进先出)的话,那就需要把in栈里的数据存放到out栈中,在对out栈进行pop输出。