代码随想录算法训练营43期 | Day 10——栈与队列part1

代码随想录算法训练营43期 | Day 10

232.用栈实现队列

class MyQueue {
public:
    stack<int> sIn;
    stack<int> sOut;
    MyQueue() {

    }
    
    void push(int x) {
        sIn.push(x);
    }
    
    int pop() {
        if(sOut.empty())
        {
            while(!sIn.empty())
            {
                sOut.push(sIn.top());
                sIn.pop();
            }
        }
        int result = sOut.top();
        sOut.pop();
        return result;

    }
    
    int peek() {
        int res = this->pop();
        sOut.push(res);
        return res;
    }
    
    bool empty() {
        return sIn.empty()&&sOut.empty();
    }
};

225. 用队列实现栈

class MyStack {
public:
    queue<int> deq1;
    MyStack() {

    }
    
    void push(int x) {