用队列实现栈

用队列实现栈

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

    }
    
    /** Push element x onto stack. */
    void push(int x) {
        q2.push(x);
        while(!q1.empty())
        {
            q2.push(q1.front());
            q1.pop();
        }
        swap(q1,q2);

    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        int a=q1.front();
        q1.pop();
        return a;

    }
    
    /** Get the top element. */
    int top() {
        return q1.front();

    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return q1.empty();

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