數(shù)據(jù)結(jié)構(gòu)之隊列——順序存儲結(jié)構(gòu)（php代碼實(shí)現(xiàn)——方法二）

SqArr=array();
        $this->front=0;
        $this->rear=0;
    }

    //銷毀隊列
    public function DestroyQueue(){
        $this->SqArr=null;
        $this->front=0;
        $this->rear=0;
    }

    //清空隊列
    public function ClearQueue(){
        $this->SqArr=array();
        $this->front=$this->rear=0;
    }

    //判斷隊列是否為空
    public function QueueEmpty(){
        if($this->front==$this->rear){
            return 'Null';
        }else{
            return 'No Null';
        }
    }

    //取得隊頭元素
    public function GetHead(){
        if($this->front == $this->rear){
            return 'ERROR';
        }
        return $this->SqArr[$this->front];
    }

    //隊列的長度
    public function QueueLenghth(){
        return $this->rear-$this->front;
    }

    //從隊尾插入元素
    public function EnQueue($elem){
        $this->SqArr[$this->rear++]=$elem;
    }

    //從隊頭刪除元素
    public function DeQueue(){
        if($this->front==$this->rear){
            return 'ERROR';
        }
        unset($this->SqArr[$this->front]);
        $this->front++;
        return 'OK';
    }

    //遍歷隊列元素
    public function QueueTraverse(){
        $arr=array();
        for($i=$this->front;$i<$this->rear;$i++){
            $arr[]=$this->SqArr[$i];
        }
        return $arr;
    }
}

網(wǎng)站題目：數(shù)據(jù)結(jié)構(gòu)之隊列——順序存儲結(jié)構(gòu)（php代碼實(shí)現(xiàn)——方法二）
鏈接URL：http://m.jiaotiyi.com/article/gehscd.html