刷题第8天

代码随想录刷题第8天 |232.用栈实现队列 225. 用队列实现栈

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();
    }
};

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

225. 用队列实现栈

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

    }

    void push(int x) {
        que.push(x);
    }
  
    int pop() {
        int size = que.size();
        size--;
        while (size--) { 
            que.push(que.front());
            que.pop();
        }
        int result = que.front(); 
        que.pop();
        return result;
    }


    int top() {
        return que.back();
    }

   
    bool empty() {
        return que.empty();
    }
};