225. 用队列实现栈

原题链接：225. 用队列实现栈

 

solution:

        用队列模拟栈，由于队列只能在末尾进入，开头出，每次pop,和top复杂度都是O(n)

class MyStack {
public:
    queue<int> que;
    MyStack() {

    }
    
    void push(int x) {
        que.push(x);
    }
    
    int pop() {
        int res = 0;
        int size = que.size();
        while(size > 1) {
            size--;
            que.push(que.front());
            que.pop();
        }
        res = que.front();
        que.pop();
        return res;
    }
    
    int top() {
        int res = 0;
        int size = que.size();
        while(size > 1) {
            size--;
            que.push(que.front());
            que.pop();
        }
        res = que.front();
        que.push(res);
        que.pop();
        return res;
    }
    
    bool empty() {
        if(que.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();
 */