核心思路,创建两个(其实是三个)来实现栈的功能,分别是老大老二还有交换栈,老大初始为空,先把元素给老二,老二调转方向再用一个交换栈和老大交换,最终老大变成了一个“栈”
class MyStack {
//用两个队列(其实是三个)来实现栈
//先创建两个队列
Queue<Integer> queue1;
Queue<Integer> queue2;
//请实现你的栈
public MyStack() {
queue1 = new LinkedList<Integer>();
queue2 = new LinkedList<Integer>();
}
//主要是压栈最复杂,先把元素给老二
public void push(int x) {
queue2.offer(x);
//如果老大不为空才可以给老二噢
while(!queue1.isEmpty()) {
queue2.offer(queue1.poll());
}
//老二已经变成一个合格的栈了,所以老大要掏空它
//交换栈
Queue<Integer> queuetmp;
queuetmp = queue1;
queue1 = queue2;
queue2 = queuetmp;
//老大成了“栈”
}
//老大成了“栈”...
public int pop() {
//正常poll
return queue1.poll();
}
public int top() {
//正常peek
return queue1.peek();
}
public boolean empty() {
//正常empty
return queue1.isEmpty();
}
}
/**
* Your MyStack object will be instantiated and called as such:
* MyStack obj = new MyStack();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.top();
* boolean param_4 = obj.empty();
*/