232. Implement queue with stack (simple)

Train of thought ： Dual stack simulation
Two stacks ：stk1 stk2
The team ： Push stk1
Out of the team ： If stk2 It's empty , Then put stk1 All out of stack and in stack stk2, And then out of the team
Team head ： That is to say stk2 Top of stack , If stk2 If it is empty, the stk1 All out of stack and in stack stk2, Then take the head of the team
It's empty ： stk1 stk2 All empty.

class MyQueue {
    
public:

    stack<int> stk1, stk2;
    MyQueue() {
    

    } 
    void push(int x) {
    
        stk1.push(x);
    }
    int pop() {
    
        if (stk2.empty()) {
    
            while (!stk1.empty()) {
    
                stk2.push(stk1.top());
                stk1.pop();
            }
        }
        int tp = stk2.top();
        stk2.pop();
        return tp;
    }
    int peek() {
    
        if (stk2.empty()) {
    
            while (!stk1.empty()) {
    
                stk2.push(stk1.top());
                stk1.pop();
            }
        }
        return stk2.top();
    }
    bool empty() {
    
        return stk1.empty() && stk2.empty();
    }
};