用两个栈实现队列

import java.util.Stack;public class Solution {    Stack<Integer> stack1 = new Stack<Integer>();    Stack<Integer> stack2 = new Stack<Integer>();    public void push(int node) {        //stack1.push(node);        while (!stack1.isEmpty()) {            stack2.push(stack1.pop());        }        stack1.push(node);        while (!stack2.isEmpty()) {            stack1.push(stack2.pop());        }    }    public int pop() {        return stack1.pop();    }//    public static void main(String[] args) {//        Solution solution = new Solution();//        solution.push(1);//        solution.push(2);//        solution.push(3);//        System.out.println(solution.pop());//        System.out.println(solution.pop());//        System.out.println(solution.pop());//    }}