leetcode：面试题 03.04. 化栈为队

题目来源

https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci/

题目描述

题目解析

两个栈：
一个读栈rStack
一个写栈wStack

当push时

• 直接往wStack压入元素

当pop时：(一个空的队列不会调用 pop 或者 peek 操作)

• 如果rStack为空，将wStack的元素全部压入rStack， 然后rStack.pop第一个元素
• 如果rStack不为空，rStack.pop第一个元素

当peek时：

• 如果rStack为空，将wStack的元素全部压入rStack， 然后rStack.peek第一个元素
• 如果rStack不为空，rStack.peek第一个元素

当empty时：

• 必须rStack.empty && wStack.empty

c++

// 假设所有操作都是有效的 （例如，一个空的队列不会调用 pop 或者 peek 操作）
class MyQueue {
private:
    std::stack<int> r_stack;
    std::stack<int> w_stack;
public:
    MyQueue() {

    }

    void push(int x) {
        w_stack.push(x);
    }

    int pop(){
        if(r_stack.empty()){
            while (!w_stack.empty()){
                r_stack.push(w_stack.top());
                w_stack.pop();
            }
        }
        
        int ans = r_stack.top();
        r_stack.pop();
        return ans;
    }

    int peek(){
        if(r_stack.empty()){
            while (!w_stack.empty()){
                r_stack.push(w_stack.top());
                w_stack.pop();
            }
        }


        return r_stack.top();
    }
    
    bool empty() {
        return r_stack.empty() && w_stack.empty();
    }
};

java

 class MyQueue {
    Stack<Integer> rStack;
    Stack<Integer> wStack;

    /** Initialize your data structure here. */
    public MyQueue() {
        rStack = new Stack<>();
        wStack = new Stack<>();
    }

    /** Push element x to the back of queue. */
    public void push(int x) {
        wStack.push(x);
    }

    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        if (rStack.empty()){
            while (!wStack.empty()){
                rStack.push(wStack.pop());
            }
        }

        return rStack.pop();
    }

    /** Get the front element. */
    public int peek() {
        if (rStack.empty()){
            while (!wStack.empty()){
                rStack.push(wStack.pop());
            }
        }

        return rStack.peek();
    }

    /** Returns whether the queue is empty. */
    public boolean empty() {
        return rStack.empty() && wStack.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();
 * boolean param_4 = obj.empty();
 */