用两个栈模拟队列

class MyQueue {
    
    public:
    stack<int>in;
    stack<int>out;
public:
    MyQueue() {
    
    }
    void in2(){
    
        while(!in.empty()){
    
            out.push(in.top());
            in.pop();
        }
    }
    void push(int x) {
    
        //入栈
        in.push(x);
    }
    
    int pop() {
    
        //出栈 就要把另一个栈全部弄过来，取栈顶
        if(out.empty()){
    
            in2();
        }
        int x=out.top();
        out.pop();
        return x;
    }
    
    int peek() {
    
        if(out.empty())
        {
    
            in2();
        }
        return out.top();
    }
    
    bool empty() {
    
            return in.empty() && out.empty();
    }
};

如有错误，多多指教