我的LeetCode代码仓:https://github.com/617076674/LeetCode
原题链接:https://leetcode-cn.com/problems/implement-stack-using-queues/description/
题目描述:
知识点:栈、队列
思路:pop()或top()操作时用另一个队列暂时保存元素
push(x)和empty()的时间复杂度是O(1)。
pop()和top()的时间复杂度是O(n),其中n为栈中的元素个数。
JAVA代码:
public class MyStack {
private Queue<Integer> queue1;
private Queue<Integer> queue2;
/** Initialize your data structure here. */
public MyStack() {
queue1 = new LinkedList<>();
queue2 = new LinkedList<>();
}
/** Push element x onto stack. */
public void push(int x) {
queue1.add(x);
}
/** Removes the element on top of the stack and returns that element. */
public int pop() {
while(queue1.size() != 1) {
queue2.add(queue1.poll());
}
int result = queue1.poll();
while(!queue2.isEmpty()) {
queue1.add(queue2.poll());
}
return result;
}
/** Get the top element. */
public int top() {
while(queue1.size() != 1) {
queue2.add(queue1.poll());
}
int result = queue1.poll();
while(!queue2.isEmpty()) {
queue1.add(queue2.poll());
}
queue1.add(result);
return result;
}
/** Returns whether the stack is empty. */
public boolean empty() {
return queue1.isEmpty() && queue2.isEmpty();
}
}
LeetCode解题报告: