代码随想录算法训练营第十天 | lc232用栈实现队列, lc225用队列实现栈

lc232用栈实现队列

文章&视频: lc232

代码:

class MyQueue {
public:
    stack<int> stIn;
    stack<int> stOut;
    MyQueue() {
        
    }
    
    void push(int x) {
        stIn.push(x);
    }
    
    int pop() {
        // 如果stOut栈为空的话，再把stIn的数据全部放入stOut
        if (stOut.empty()) {
            while(!stIn.empty()) {
                int top = stIn.top();
                stOut.push(top);
                stIn.pop();
            }
        }
        int result = stOut.top();
        stOut.pop();
        return result;
    }
    
    int peek() {
        int top = this->pop();
        stOut.push(top);
        return top;
    }
    
    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();
 */

lc225 用队列实现栈

文章&视频: lc225

代码:

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

    }
    
    void push(int x) {
        que.push(x);
    }
    
    int pop() {
        int result = que.back();
        for (int i = que.size(); i > 1; i--) {
            int top = que.front();
            que.pop();
            que.push(top);
        }
        que.pop();
        return result;
    }
    
    int top() {
        return que.back();
    }
    
    bool empty() {
        return que.empty();
    }
};

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack* obj = new MyStack();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->top();
 * bool param_4 = obj->empty();
 */