剑指 Offer 09. 用两个栈实现队列
力扣官方题解:
class CQueue {
//定义两个栈
Stack<Integer> stack1;
Stack<Integer> stack2;
//初始化
public CQueue() {
stack1 = new Stack<>();
stack2 = new Stack<>();
}
/**
* stack1负责进,stack2负责出
* @param value
*/
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
// stack2非空时,意味着还保留上一次放进来的值,
// 此时直接删除stack2的值就保证是删除队列尾部的值
if (stack2.isEmpty()) {
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
}
if (stack2.isEmpty()) {
return -1;
} else {
int deleteItem = stack2.pop();
return deleteItem;
}
}
}
题解区k神:
class CQueue {
LinkedList<Integer> A, B;
public CQueue() {
A = new LinkedList<Integer>();
B = new LinkedList<Integer>();
}
public void appendTail(int value) {
A.addLast(value);
}
public int deleteHead() {
if(!B.isEmpty()) return B.removeLast();
if(A.isEmpty()) return -1;
while(!A.isEmpty())
B.addLast(A.removeLast());
return B.removeLast();
}
}
思想是一样的,但是用链表比用栈时间复杂度低。