PHP实现链表(暂存)

<?php
class node{
    public $data;
    public $next;
    public function __construct($data){
        $this->data = $data; 
        $this->next = NULL;
    }
}

class Linklist{
    public $head = NULL;
    public $length = 0;

    public function __construct($data=NULL){
        $this->head = new node($data);
    }

    public function isEmpty(){
        return $this->head->next == NULL;
    }

    public function getTail(){
        $current = $this->head;
        while($current->next != NULL){
            $current = $current->next;
        }
        return $current;
    }

    public function print_list(){
        $current = $this->head->next;
        while($current != NULL){
            echo $current->data,'<br/>';
            $current = $current->next;
        }
    }

    public function push_front($node){
        $node->next = $this->head->next;
        $this->head->next = $node;
        $this->length++;
    }


    public function push_back($node){
        $tail = $this->getTail();
        $tail->next = $node;
        $this->length++;
    }

    public function pop_front(){
        if($this->isEmpty()){
            return false;
        }
        $this->head->next = $this->head->next->next;
        $this->length--;
        return true;
    }

    public function pop_back(){
        if($this->isEmpty()){
            return false;
        }
        $current = $this->head;
        $tmp = NULL;
        while($current->next != NULL){
            $tmp = $current;
            $current = $current->next;
        }
        $tmp->next = NULL;
        $this->length--;
        return true;
    }

    public function del_element($data){
        $current = $this->head->next;
        $tmp = $this->head;
        while($current != NULL){
            if($current->data == $data){
                $tmp->next = $current->next;
                return true;
            }
            $tmp = $current;
            $current = $current->next;
        }
        return false;
    }

    public function reverse_list(){
        $current = $this->head->next;
        $tmp = NULL;
        $rlist = NULL;
        while($current != NULL){
            $tmp = $current->next;
            $current->next = $rlist;
            $rlist = $current;
            $current = $tmp;
        }
        $this->head->next = $rlist;
    }


}

?>
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值