栈:后进先出
队列:先进先出
题目:用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入结点和在队列头部删除结点的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
我的解法
用时击败29%
内存击败34%
效率依旧不是很高,主要问题在deleteHead()判断太多了
class CQueue {
private Stack<Integer> stack1;
private Stack<Integer> stack2;
public CQueue() {
stack1 = new Stack<Integer>();
stack2 = new Stack<Integer>();
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if (stack2.isEmpty()) {
if (stack1.isEmpty()) {
return -1;
} else {
while (!stack1.isEmpty()) {
int temp = stack1.pop();
stack2.push(temp);
}
return stack2.pop();
}
} else {
return stack2.pop();
}
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/
力扣官方
用时击败43%
内存击败34
有一些进步,好像都没有出现100%的写法
class CQueue {
private Stack<Integer> stack1;
private Stack<Integer> stack2;
public CQueue() {
stack1 = new Stack<Integer>();
stack2 = new Stack<Integer>();
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if (stack2.isEmpty()) {
while (!stack1.isEmpty()) {
int temp = stack1.pop();
stack2.push(temp);
}
}
// 通过之前stack1弹栈,再次判断stack2是否有元素
if (stack2.isEmpty()) {
return -1;
} else {
return stack2.pop();
}
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/