请你仅使用两个栈实现先入先出队列。队列应当支持一般队列支持的所有操作(push、pop、peek、empty):
实现 MyQueue 类:
void push(int x) 将元素 x 推到队列的末尾
int pop() 从队列的开头移除并返回元素
int peek() 返回队列开头的元素
boolean empty() 如果队列为空,返回 true ;否则,返回 false
说明:
你 只能 使用标准的栈操作 —— 也就是只有 push to top, peek/pop from top, size, 和 is empty 操作是合法的。
你所使用的语言也许不支持栈。你可以使用 list 或者 deque(双端队列)来模拟一个栈,只要是标准的栈操作即可。
输入:["MyQueue", "push", "push", "peek", "pop", "empty"][[], [1], [2], [], [], []]输出:[null, null, null, 1, 1, false]解释: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 1myQueue.pop(); // return 1, queue is [2]myQueue.empty(); // return false
var MyQueue = function () {this.stack = []this._stack = []};MyQueue.prototype.move = function (x) {if (this._stack.length) {return true;}this._stack = this.stack.reverse().concat(this._stack)this.stack = []}/*** @param {number} x* @return {void}*/MyQueue.prototype.push = function (x) {this.stack.push(x)};/*** @return {number}*/MyQueue.prototype.pop = function () {this.move()return this._stack.pop()};/*** @return {number}*/MyQueue.prototype.peek = function () {this.move()return this._stack[this._stack.length - 1]};/*** @return {boolean}*/MyQueue.prototype.empty = function () {return !this._stack.length && !this.stack.length};/*** 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()*/

