两个栈实现一个队列

import java.utils.Stack

public class Solution{
    Stack<Integer> stack1 = new Stack<Integer>();
    Stack<Integet> stack2 = new Stack<Integer>();

    puvlic void push(int node){
        stack1.push(node);
    }      

    public int pop(){
        if(stack2.size() <= 0){
            while(stack1.size() != 0){
                stack2.push(stack1.pop());
            }
        }
        return stack2.pop();
    }
}