代码随想录刷题第十天

代码随想录刷题第十天

用栈实现队列

/*
 * @lc app=leetcode.cn id=232 lang=cpp
 *
 * [232] 用栈实现队列
 */

// @lc code=start
#include<iostream>
#include <stack>
using namespace std;

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() {
        if (stOut.empty())
        {
            while (!stIn.empty())
            {
                stOut.push(stIn.top());
                stIn.pop();
            }
        }
        int result = stOut.top();
        
        return result;
    }
    
    bool empty() {
        bool result = stIn.empty() && stOut.empty();
        return result;
    }
};

/**
 * 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();
 */
// @lc code=end

了解模拟过程

用队列实现栈

/*
 * @lc app=leetcode.cn id=225 lang=cpp
 *
 * [225] 用队列实现栈
 */

// @lc code=start
#include <deque>
#include <queue>
using namespace std;

class MyStack {
public:

    queue<int> que1;
    queue<int> que2;
    MyStack() {

    }
    
    void push(int x) {
        que1.push(x);
    }
    
    int pop() {
        int size = que1.size();
        while (size > 1)
        {
            que2.push(que1.front());
            que1.pop();
            size--;
        }
        int result = que1.front();
       // que1.pop();
        que1 = que2;
        while (!que2.empty())//清空很关键不能忘记
        {
            que2.pop();
        }
        
        return result;
    }
    
    int top() {
        int result = que1.back();
        return result;
    }
    
    bool empty() {
        return que1.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();
 */
// @lc code=end