LeetCode 225. 用队列实现栈

题目

题解

• 两个队列
  第二个队列是第一个队列的备份
  注意：队列有头尾front，back，利用队列的size
  可以将que2赋值给que1
• 一个队列
  无需备份，将pop掉的元素再push进队尾，利用size

代码

class MyStack {
public:
    /** Initialize your data structure here. */
    queue<int> que1;
    queue<int> que2;
    MyStack() {

    }
    
    /** Push element x onto stack. */
    void push(int x) {
        que1.push(x);
    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        int l=que1.size();
        while(l>1){  
            que2.push(que1.front());
            que1.pop();
            l--;
        }
        int res=que1.front();
        que1=que2;
        while(!que2.empty()){
            que2.pop();
        }
        return res;
    }
    
    /** Get the top element. */
    int top() {
        return que1.back();
    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return que1.empty();
    }
};

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