解题思路
stack1用来进行反转
stack2用来当作真正的队列
代码
import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
while (!stack2.empty()){
stack1.push(stack2.pop());
}
stack1.push(node);
while (!stack1.empty()){
stack2.push(stack1.pop());
}
}
public int pop() {
if (!stack2.empty()) return stack2.pop();
return -1;
}
}