【剑指 Offer09】用两个栈实现队列
/*** 剑指 Offer 09. 用两个栈实现队列
* https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/
* */
public class CQueue {
private Deque<Integer> stack1;
private Deque<Integer> stack2;
public CQueue() {
stack1 = new ArrayDeque<>();
stack2 = new ArrayDeque<>();
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if (stack2.isEmpty()) {
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
}
if (!stack2.isEmpty()) {
return stack2.pop();
}
return -1;
}
}
免责声明：如果侵犯了您的权益，请联系站长，我们会及时删除侵权内容，谢谢合作！
页:
[1]