[leetcode]232. Implement Queue using Stacks

[leetcode]232. Implement Queue using Stacks

---

Analysis

厉害的人总是那么的厉害呀~—— [菜鸡反省中~]

Implement the following operations of a queue using stacks.
push(x) – Push element x to the back of queue.
pop() – Removes the element from in front of queue.
peek() – Get the front element.
empty() – Return whether the queue is empty.
用栈实现队列，跟前面那个用队列实现栈几乎一样：
https://blog.csdn.net/weixin_32135877/article/details/80671174

Implement

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

    }

    /** Push element x to the back of queue. */
    void push(int x) {
        stack<int> t;
        while(!mystack.empty()){
            t.push(mystack.top());
            mystack.pop();
        }
        t.push(x);
        while(!t.empty()){
            mystack.push(t.top());
            t.pop();
        }
    }

    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        int t = mystack.top();
        mystack.pop();
        return t;
    }

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

    /** Returns whether the queue is empty. */
    bool empty() {
        return mystack.empty();
    }

private:
    stack<int> mystack;
};

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