232. 用栈实现队列

232. 用栈实现队列

题目描述：
请你仅使用两个栈实现先入先出队列。队列应当支持一般队列的支持的所有操作（push、pop、peek、empty）：实现 MyQueue 类：
void push(int x) 将元素 x 推到队列的末尾
int pop() 从队列的开头移除并返回元素
int peek() 返回队列开头的元素
boolean empty() 如果队列为空，返回 true ；否则，返回 false

示例：

输入：
["MyQueue", "push", "push", "peek", "pop", "empty"]
[[], [1], [2], [], [], []]
输出：
[null, null, null, 1, 1, false]

解释：
MyQueue myQueue = new MyQueue();
myQueue.push(1); // queue is: [1]
myQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue)
myQueue.peek(); // return 1
myQueue.pop(); // return 1, queue is [2]
myQueue.empty(); // return false

class MyQueue {
public:
    /** Initialize your data structure here. */
    
    
    stack<int> instack,outstack;  //使用两个栈来实现队列的先进先出
    
    void outToStack2(){
        while(!instack.empty()){
            int x = instack.top();
            instack.pop();
            outstack.push(x);
        }
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        instack.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if(outstack.empty()){
            outToStack2();
        }
        int x = outstack.top();
        outstack.pop();
        return x;
    }
    
    /** Get the front element. */
    int peek() {
        if(outstack.empty()){
            outToStack2();
        }
        return outstack.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if(instack.empty()&&outstack.empty())
        {
            return true;
        }
        return false;
    }
};

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