LeetCode225. 用队列实现栈

225. 用队列实现栈

class MyStack {
public:
    /** Initialize your data structure here. */
    MyStack() {

    }
    
    /** Push element x onto stack. */
    void push(int x) {
        if(q1.empty() && q2.empty()) {
            q1.push(x);
        }
        else if(q1.empty()) {
            q2.push(x);
        }
        else {
            q1.push(x);
        }
    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        if(q1.empty()) {
            while(q2.size() != 1) {
                q1.push(q2.front());
                q2.pop();
            }
            int ans = q2.front();
            q2.pop();
            return ans;
        }
        if(q2.empty()) {
            while(q1.size() != 1) {
                q2.push(q1.front());
                q1.pop();
            }
            int ans = q1.front();
            q1.pop();
            return ans;
        }
        return -1;
    }
    
    /** Get the top element. */
    int top() {
        if(q1.empty()) {
            while(q2.size() != 1) {
                q1.push(q2.front());
                q2.pop();
            } 
            int top = q2.front();
            q1.push(q2.front());
            q2.pop();
            return top;
        } else {
            while(q1.size() != 1) {
                q2.push(q1.front());
                q1.pop();
            }
            int top = q1.front();
            q2.push(q1.front());
            q1.pop();
            return top;
        }
    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return q1.empty() && q2.empty();
    }
private:
    queue<int> q1;
    queue<int> q2;
};

/**
 * 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();
 */