LeetCode 232. Implement Queue using Stacks

链接：https://leetcode.com/problems/implement-queue-using-stacks/

思路

使用两个栈，stk1用作主要存储。假设已经往stk1里push一些元素，现在要pop，即取栈底的元素，则把上面的元素暂存到stk2里再取栈底。此时把stk2元素放回stk1可恢复原来的顺序，但是，如果下个操作还是pop，此时可以直接取stk2的栈顶。因此，我们不着急恢复stk1，直到需要push时才将stk2的元素放回stk1。

代码

class MyQueue {
private:
    stack<int> stk1, stk2;
public:
    /** Initialize your data structure here. */
    MyQueue() {
        
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        while(!stk2.empty()) {
            stk1.push(stk2.top());
            stk2.pop();
        }   
        stk1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        while(!stk1.empty()) {
            stk2.push(stk1.top());
            stk1.pop();
        }
        int tmp = stk2.top();
        stk2.pop();
        return tmp;
    }
    
    /** Get the front element. */
    int peek() {
        while(!stk1.empty()) {
            stk2.push(stk1.top());
            stk1.pop();
        }
        return stk2.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        return stk1.empty() && stk2.empty();
    }
};

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