请你仅使用两个栈实现先入先出队列。队列应当支持一般队列的支持的所有操作(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(双端队列)来模拟一个栈,只要是标准的栈操作即可。
/**
* Initialize your data structure here.
*/
var MyQueue = function() {
this.stack_push = new Array();
this.stack_pop = new Array();
};
/**
* Push element x to the back of queue.
* @param {number} x
* @return {void}
*/
MyQueue.prototype.push = function(x) {
this.stack_push.push(x);
};
/**
* Removes the element from in front of queue and returns that element.
* @return {number}
*/
MyQueue.prototype.pop = function() {
if(this.stack_pop.length === 0){
while(this.stack_push.length>0){
this.stack_pop.push(this.stack_push.pop());
}
return this.stack_pop.pop();
}
return this.stack_pop.pop();
};
/**
* Get the front element.
* @return {number}
*/
MyQueue.prototype.peek = function() {
if(this.stack_pop.length === 0){
while(this.stack_push.length>0){
this.stack_pop.push(this.stack_push.pop());
}
return this.stack_pop[this.stack_pop.length-1];
}else {
return this.stack_pop[this.stack_pop.length-1];
}
};
/**
* Returns whether the queue is empty.
* @return {boolean}
*/
MyQueue.prototype.empty = function() {
if(this.stack_push.length>0 || this.stack_pop.length>0) {
return false;
}else {
return true;
}
};
/**
* 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()
*/