代码随想录-栈与队列(232. 用栈实现队列、225. 用队列实现栈)

232. 用栈实现队列

class MyQueue {
public:
    stack<int> in;
    stack<int> out;
    int size = 0;

    MyQueue() {
        
    }
    
    void push(int x) {
       this->in.push(x); 
       this->size++;
    }
    
    int pop() {
        if (this->out.empty()==true)
        {
            
            while(this->in.empty()!=true)
            {             
                           this->out.push(this->in.top());
                this->in.pop();
            }
        }
        this->size--;
        int num = this->out.top();
        this->out.pop();
        return num;
    }
    
    int peek() {
        if (this->out.empty()==true)
        {
            while (!this->in.empty())
            {
                this->out.push(this->in.top());
             this->in.pop();
            }
             
        }
        return this->out.top();
    }
    
    bool empty() {
        if (this->size<=0) return true;
        return false;
    }
    
    
    
};

/**
 * 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> que1;
    queue<int> que2;
    int size = 0;

    MyStack() {

    }
    
    void push(int x) {
        que1.push(x);
        size++;
    }
    
    int pop() {
        while (que1.size()>1)
        {
            que2.push(que1.front());
            que1.pop();
        }
        int num = que1.front();
        que1.pop();
        while (!que2.empty())
        {
            que1.push(que2.front());
            que2.pop();
        }
        size--;
        return num;     
        
    }
    
    int top() {
        return que1.back();
      }
    
    bool empty() {
        if (size<=0) return true;
        return false;
    }
};

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

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值