【LeetCode 0232】【设计】用FILO栈实现FIFO队列

232. Implement Queue using Stacks

Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).

Implement the MyQueue class:

• void push(int x) Pushes element x to the back of the queue.
• int pop() Removes the element from the front of the queue and returns it.
• int peek() Returns the element at the front of the queue.
• boolean empty() Returns true if the queue is empty, false otherwise.

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, the stack may not be supported natively. You may simulate a stack using a list or deque (double-ended queue) as long as you use only a stack’s standard operations.

Example 1:

**Input**
["MyQueue", "push", "push", "peek", "pop", "empty"]
[[], [1], [2], [], [], []]
**Output**
[null, null, null, 1, 1, false]

**Explanation**
MyQueue myQueue = new MyQueue();
myQueue.push(1); // queue is: [1]
myQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue)
myQueue.peek(); // return 1
myQueue.pop(); // return 1, queue is [2]
myQueue.empty(); // return false

Constraints:

• 1 <= x <= 9
• At most 100 calls will be made to push, pop, peek, and empty.
• All the calls to pop and peek are valid.

Follow-up: Can you implement the queue such that each operation is amortized O(1) time complexity? In other words, performing n operations will take overall O(n) time even if one of those operations may take longer.

Idea

1.利用JS/ECMA6数组实现具备pop/push/empty/peek等操作的栈类
2.使用两个栈，分别作为队列入队列栈和出队列栈
* 入队列时，直接往入队列栈压入数据
* 出队列时，如果出队列栈不为空，直接弹栈；如果出队列栈为空则将入队列栈元素倒入出队列栈
* 查看队列头元素时，同出队列操作一样，只是我们不需要只是查看头元素而不是出队列
* 判断队列是否为空，当且仅当两个栈都为空。

JavaScript Solution

class Stack {
    constructor(){
        this.elements = [];
    }
    push(e){
        this.elements.push(e)
    }
    pop(){
        return this.empty()?undefined:this.elements.pop()
    }
    peek(){
        return this.empty()?undefined:this.elements[elements.length-1];
    } 
    empty(){
        return !this.elements.length
    }
}

var MyQueue = function() {
    this.enqueStack = new Stack()
    this.dequeStack = new Stack()
};

/** 
 * @param {number} x
 * @return {void}
 */
MyQueue.prototype.push = function(x) {
    this.enqueStack.push(x)
};

/**
 * @return {number}
 */
MyQueue.prototype.pop = function() {
    if(this.dequeStack.empty()){
        while(!this.enqueStack.empty()){
            this.dequeStack.push(this.enqueStack.pop())
        }
    }
    return this.dequeStack.pop()
};

/**
 * @return {number}
 */
MyQueue.prototype.peek = function() {
    if(this.dequeStack.empty()){
        while(!this.enqueStack.empty()){
            this.dequeStack.push(this.enqueStack.pop())
        }
    }
    return this.dequeStack.peek()
};

/**
 * @return {boolean}
 */
MyQueue.prototype.empty = function() {
    return this.enqueStack.empty() && this.dequeStack.empty()
};

/** 
 * Your MyQueue object will be instantiated and called as such:
 * var obj = new MyQueue()
 * obj.push(x)
 * var param_2 = obj.pop()
 * var param_3 = obj.peek()
 * var param_4 = obj.empty()
 */