代码随想录第10天

232. 用栈实现队列

代码

class MyQueue {
private:
    stack<int> stin; //输入栈
    stack<int> stout; //输出栈
public:
    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() {
        if(stout.empty()){
        while(!stin.empty()){
            stout.push(stin.top());
            stin.pop();
        }
        }
        return stout.top();
    }
    
    bool empty() {
        return stin.empty()&&stout.empty();
    }
};

225. 用队列实现栈

        代码

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

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