Implement Stack using Queues.cpp

// Runtime: 8 ms (Top 6.60%) | Memory: 7 MB (Top 20.63%)
class MyStack {
public:
    queue<int> q1;
    queue<int> q2;
    MyStack() {

    }

    void push(int x) {
        q1.push(x);
    }

    int pop() {

        while(q1.size() !=1){
         int temp = q1.front();
            q1.pop();
            q2.push(temp);
        }
        int temp = q1.front();
        q1.pop();
        while(!q2.empty()){
            int tp = q2.front();
            q2.pop();
            q1.push(tp);
        }
        return temp;
    }

    int top() {
        while(q1.size() !=1){
         int temp = q1.front();
            q1.pop();
            q2.push(temp);
        }
        int temp = q1.front();
        q1.pop();
        q2.push(temp);
        while(!q2.empty()){
            int tp = q2.front();
            q2.pop();
            q1.push(tp);
        }
        return temp;
    }

    bool empty() {
        if(q1.empty()){
            return true;
        }
        return false;
    }
};

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack* obj = new MyStack();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->top();
 * bool param_4 = obj->empty();
 */