import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack2.push(node);
}
public int pop() {
if(stack1.size()==0)
while(!stack2.empty())
stack1.push(stack2.pop());
return stack1.pop();
}
} 
京公网安备 11010502036488号