代码随想录算法训练营第十天 | 力扣 ● 232.用栈实现队列● 225. 用队列实现栈

● 232.用栈实现队列

class MyQueue {
public:
    stack<int> ins;
    stack<int> outs;
    MyQueue() {

    }
    
    void push(int x) {
        ins.push(x);
    }
    
    int pop() {
        if(outs.empty()){
            while(!ins.empty()){
                outs.push(ins.top());
                ins.pop();
            }
        }
        int result = outs.top();
        outs.pop();
        return result;
    }
    
    int peek() {
        //注意这里的复用了类的函数
        int result = this->pop();
        outs.push(result);
        return result;
    }
    
    bool empty() {
        return ins.empty()&&outs.empty();
    }
};

● 225. 用队列实现栈

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

    }
    
    void push(int x) {
        q.push(x);
    }
    
    int pop() {
        int size = q.size();
        size--;
        while(size--){
            q.push(q.front());
            q.pop();
        }
        int result = q.front();
        q.pop();
        return result;
    }
    
    int top() {
        return q.back();
    }
    
    bool empty() {
        return q.empty();
    }
};