Leetcode-栈与队列-232. 用栈实现队列

题目232. 用栈实现队列：

题解：

一个输入栈，一个输出栈

代码：

class MyQueue {
private:
     stack<int> sin;
     stack<int> sout;
     int  size;
     void in2out()
     {
         while(!sin.empty())
         {
             sout.push(sin.top());
             sin.pop();
         }
     }

public:
    
    /** Initialize your data structure here. */
    MyQueue() {
        size = 0;
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        size++;
        sin.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if(sout.empty())
        {
          in2out();
        }
        size--;
        int x = sout.top();
        sout.pop();
        return x;
    }
    
    /** Get the front element. */
    int peek() {
        if(sout.empty())
        {
            in2out();
        } 
        return sout.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if(size == 0){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();
 */