232-用栈实现队列

Description

Implement the following operations of a queue using stacks.

• push(x) – Push element x to the back of queue.
• pop() – Removes the element from in front of queue.
• peek() – Get the front element.
• empty() – Return whether the queue is empty.

---

Notes:

• You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is empty operations are valid.
• Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
• You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

---

问题描述

用stack实现queue的如下操作

• push(x)–将元素放入queue的尾部
• pop()–删除并返回queue的头部元素
• peek()–返回queue的头部元素
• empty()–判断queue是否空

---

问题分析

对于队列来说，每次push都是将元素放入尾部，而栈每次放入头部，因此我们可以维护两个栈，stack1(存放元素的栈)和stack2(辅助栈),每次元素入栈，将stack1的所有元素pop入stack2，将新元素放入栈，然后将stack2的所有元素pop入stack1.
这样也就使得新入栈的元素放入了尾部，而之前入栈的元素访问的顺序不变

---

解法

class MyQueue {
    int front;
    Stack<Integer> stack1;
    Stack<Integer> stack2;

    public MyQueue() {
        front = -1;
        stack1 = new Stack<Integer>();
        stack2 = new Stack<Integer>();
    }

    public void push(int x) {
        if(stack1.empty()){
            front = x;
        }
        while(!stack1.empty()){
            stack2.push(stack1.pop());
        }
        stack1.push(x);
        while(!stack2.empty()){
            stack1.push(stack2.pop());
        }
    }

    public int pop() {
        int num = stack1.pop();
        if(!stack1.empty()) front = stack1.peek();
        return num;
    }

    public int peek() {
        return front;
    }

    public boolean empty() {
        return stack1.empty();
    }
}