<?php
// Exercise: Implement Queue using Stacks
class MyQueue {
protected $queue;
/**
* Initialize your data structure here.
*/
function __construct() {
$this->queue = new \SplStack;
}
/**
* Push element x to the back of queue.
* @param Integer $x
* @return NULL
*/
function push($x) {
$this->queue->push($x);
}
/**
* Removes the element from in front of queue and returns that element.
* @return Integer
*/
function pop() {
$length = count($this->queue);
$temp = [];
while(!$this->queue->isEmpty()){
$rv = $this->queue->pop();
if(!$this->queue->isEmpty()){
$temp[] = $rv;
}
}
for($i = count($temp)-1; $i >= 0; $i--){
$this->queue->push($temp[$i]);
}
return $rv;
}
/**
* Get the front element.
* @return Integer
*/
function peek() {
return $this->queue->bottom();
}
/**
* Returns whether the queue is empty.
* @return Boolean
*/
function empty() {
return $this->queue->isEmpty();
}
}
/**
* Your MyQueue object will be instantiated and called as such:
* $obj = MyQueue();
* $obj->push($x);
* $ret_2 = $obj->pop();
* $ret_3 = $obj->peek();
* $ret_4 = $obj->empty();
*/