【LeetCode击败99%+】化栈为队

题目

• 实现一个MyQueue类，该类用两个栈来实现一个队列。

示例：

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);
queue.peek();  // 返回 1
queue.pop();   // 返回 1
queue.empty(); // 返回 false

说明：

• 你只能使用标准的栈操作 – 也就是只有 push to top, peek/pop from top, size 和 is empty
• 操作是合法的。 你所使用的语言也许不支持栈。你可以使用 list 或者 deque（双端队列）来模拟一个栈，只要是标准的栈操作即可。
• 假设所有操作都是有效的 （例如，一个空的队列不会调用 pop 或者 peek 操作）。

代码

class MyQueue {

    Stack<Integer> appendStack;
    Stack<Integer> deleteHeadStack;
    
    /** Initialize your data structure here. */
    public MyQueue() {
        this.appendStack = new Stack<Integer>();
        this.deleteHeadStack = new Stack<Integer>();
    }

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

    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        if (appendStack.size()==0) return -1;
        int size = appendStack.size();
        for (int i = 0; i < size; i++) {
            deleteHeadStack.push(appendStack.pop());
        }
        int head = deleteHeadStack.pop();
        size = deleteHeadStack.size();
        for (int i = 0; i < size; i++) {
            appendStack.push(deleteHeadStack.pop());
        }
        return head;
    }

    /** Get the front element. */
    public int peek() {
        if (appendStack.size()==0) return -1;
        int size = appendStack.size();
        for (int i = 0; i < size; i++) {
            deleteHeadStack.push(appendStack.pop());
        }
        int head = deleteHeadStack.peek();
        size = deleteHeadStack.size();
        for (int i = 0; i < size; i++) {
            appendStack.push(deleteHeadStack.pop());
        }
        return head;
    }

    /** Returns whether the queue is empty. */
    public boolean empty() {
        return appendStack.size() == 0;
    }
}

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

结果

用时	内存
击败59.17%	击败96.99%

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。