php实现双向队列算法代码
PHP如何实现双向队列
<?php
class deque
{
public $queue = array();
public $length = 0;
public function frontAdd($node){
array_unshift($this->queue,$node);
$this->countqueue();
}
public function frontRemove(){
$node = array_shift($this->queue);
$this->countqueue();
return $node;
}
public function rearAdd($node){
array_push($this->queue,$node);
$this->countqueue();
}
public function rearRemove(){
$node = array_pop($this->queue);
$this->countqueue();
return $node;
}
public function countqueue(){
$this->length = count($this->queue);
}
}
// 测试用，面试答题可不写以下部分
$fruit = new deque();
echo $fruit -> length;
$fruit -> frontAdd("Apple");
$fruit -> rearAdd("Watermelon");
print_r($fruit);
?>
PHP怎么学习？PHP怎么入门？PHP在哪学？PHP怎么学才快？不用担心，这里为大家提供了PHP速学教程(入门到精通)，有需要的小伙伴保存下载就能学习啦！
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号
556
收藏
