面试题 03.04. 化栈为队/面试题09. 用两个栈实现队列/232. 用栈实现队列

2020-05-08

1.题目描述

用两个栈实现一个队列

2.题解

将一个栈用来进行入操作，另一个进行出操作，入栈直接入，出栈的时候如果是空的则把另一个
栈中的所有元素移动过来，再进行出栈，否则直接出栈即可。

3.代码

面试题 03.04.

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        s1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if (s2.empty()){
            while (!s1.empty()){
                int t=s1.top();
                s1.pop();
                s2.push(t);
            }
        }
        int r=s2.top();
        s2.pop();
        return r;
    }
    
    /** Get the front element. */
    int peek() {
        if (s2.empty()){
            while (!s1.empty()){
                int t=s1.top();
                s1.pop();
                s2.push(t);
            }
        }
        return s2.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if (s1.empty()&&s2.empty()) return true;
        return false;
    }
    stack<int> s1,s2;
    // s1专门用来入栈，s2专门用来出栈
};

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

面试题09.

class CQueue {
public:
    CQueue() {

    }
    
    void appendTail(int value) {
        s1.push(value);
    }
    
    int deleteHead() {
        if (s1.empty()&&s2.empty()) return -1;
        if (s2.empty()){
            while (!s1.empty()){
                s2.push(s1.top());
                s1.pop();
            }
        }
        int t=s2.top();
        s2.pop();
        return t;
    }
    stack<int> s1,s2;
};

/**
 * Your CQueue object will be instantiated and called as such:
 * CQueue* obj = new CQueue();
 * obj->appendTail(value);
 * int param_2 = obj->deleteHead();
 */

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {

    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        s1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if (s2.empty()){
            while (!s1.empty()){
                s2.push(s1.top());
                s1.pop();
            }
        }
        int t=s2.top();
        s2.pop();
        return t;
    }
    
    /** Get the front element. */
    int peek() {
        if (s2.empty()){
            while (!s1.empty()){
                s2.push(s1.top());
                s1.pop();
            }
        }
        return s2.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if (s1.empty()&&s2.empty()) return true;
        return false;
    }
    stack<int>s1,s2;
};

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