代码随想录算法训练营13期第10天| 232.用栈实现队列 | 225. 用队列实现栈

1. 题目链接: 232.用栈实现队列.
   个人题解如下：

class MyQueue 
{
public:
    stack<int> stIn;
    stack<int> stOut;

    MyQueue() 
    {

    }
    
    void push(int x) 
    {
        stIn.push(x);
    }
    
    int pop() 
    {
        if (stOut.empty())
        {
            while (!stIn.empty())
            {
                stOut.push(stIn.top());
                stIn.pop();
            }
        }

        int result = stOut.top();
        stOut.pop();

        return result;
    }
    
    int peek() 
    {
        int res = this->pop();
        stOut.push(res);
        return res;
    }
    
    bool empty() 
    {
        return stIn.empty() && stOut.empty();
    }
};

2. 题目链接: 225. 用队列实现栈.
   个人题解如下：

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

    }
    
    void push(int x) {
        que1.push(x);
    }
    
    int pop() {
        int size = que1.size();
        size --;
        while(size--)
        {
            que2.push(que1.front());
            que1.pop();
        }

        int result = que1.front();
        que1.pop();
        que1 = que2;
        while(!que2.empty())
        {
            que2.pop();
        }

        return result;
    }
    
    int top() {
        return que1.back();
    }
    
    bool empty() {
        return que1.empty();
    }
};