How to implement singly linked list in php

php method to implement a singly linked list: first write the class of the linked list node; then define two methods in the linked list, namely insertion and deletion; then get the length of the linked list and add node data; finally get the node name And just delete or update it.

#The operating environment of this article: Windows7 system, PHP7.1, Dell G3 computer.

Singly linked list implemented in PHP

As the name suggests, a singly linked list is a linked data structure. It has a header, and all nodes except the last node are has its successor node. As shown below.

First, we write the class of the linked list node. Each node in the singly linked list saves its data field and back-drive pointer

//链表节点 
class node { 
    public $id; //节点id 
    public $name; //节点名称 
    public $next; //下一节点 
   
    public function __construct($id, $name) { 
        $this->id = $id; 
        $this->name = $name; 
        $this->next = null; 
    } 
}

There are two particularly important methods in the linked list, insertion and deletion. Insertion requires finding the insertion position, pointing the next pointer of the previous element to the inserted node, and pointing the next pointer of the inserted node to the next node, as shown on the left side of the figure below. Deletion points the next pointer of the previous node to the next node and returns the data content of the deleted element, as shown on the right side of the figure below.

Recommended: "PHP Video Tutorial"

//单链表 
class singelLinkList { 
    private $header; //链表头节点 
   
    //构造方法 
    public function __construct($id = null, $name = null) { 
        $this->header = new node ( $id, $name, null ); 
    } 
 
    //获取链表长度 
    public function getLinkLength() { 
        $i = 0; 
        $current = $this->header; 
        while ( $current->next != null ) { 
            $i ++; 
            $current = $current->next; 
        } 
        return $i; 
    } 
 
    //添加节点数据 
    public function addLink($node) { 
        $current = $this->header; 
        while ( $current->next != null ) { 
            if ($current->next->id > $node->id) { 
                break; 
            } 
            $current = $current->next; 
        } 
        $node->next = $current->next; 
        $current->next = $node; 
    } 
 
    //删除链表节点 
    public function delLink($id) { 
        $current = $this->header; 
        $flag = false; 
        while ( $current->next != null ) { 
            if ($current->next->id == $id) { 
                $flag = true; 
                break; 
            } 
            $current = $current->next; 
        } 
        if ($flag) { 
            $current->next = $current->next->next; 
        } else { 
            echo "未找到id=" . $id . "的节点！<br>"; 
        } 
    }
 
    //判断连表是否为空
    public function isEmpty(){
            return $this->header == null;
    }
 
    //清空链表
    public function clear(){
            $this->header = null;
    } 
 
    //获取链表 
    public function getLinkList() { 
        $current = $this->header; 
        if ($current->next == null) { 
            echo ("链表为空!"); 
            return; 
        } 
        while ( $current->next != null ) { 
            echo &#39;id:&#39; . $current->next->id . &#39;   name:&#39; . $current->next->name . "<br>"; 
            if ($current->next->next == null) { 
                break; 
            } 
            $current = $current->next; 
        } 
    } 
 
    //获取节点名字 
    public function getLinkNameById($id) { 
        $current = $this->header; 
        if ($current->next == null) { 
            echo "链表为空!"; 
            return; 
        } 
        while ( $current->next != null ) { 
            if ($current->id == $id) { 
                break; 
            } 
            $current = $current->next; 
        } 
        return $current->name; 
    } 
 
    //更新节点名称 
    public function updateLink($id, $name) { 
        $current = $this->header; 
        if ($current->next == null) { 
            echo "链表为空!"; 
            return; 
        } 
        while ( $current->next != null ) { 
            if ($current->id == $id) { 
                break; 
            } 
            $current = $current->next; 
        } 
        return $current->name = $name; 
    } 
}
$lists = new singelLinkList (); 
$lists->addLink ( new node ( 5, &#39;eeeeee&#39; ) ); 
$lists->addLink ( new node ( 1, &#39;aaaaaa&#39; ) ); 
$lists->addLink ( new node ( 6, &#39;ffffff&#39; ) ); 
$lists->addLink ( new node ( 4, &#39;dddddd&#39; ) ); 
$lists->addLink ( new node ( 3, &#39;cccccc&#39; ) ); 
$lists->addLink ( new node ( 2, &#39;bbbbbb&#39; ) ); 
$lists->getLinkList (); 
echo "<br>-----------删除节点--------------<br>"; 
$lists->delLink ( 5 ); 
$lists->getLinkList ();
echo "<br>-----------更新节点名称--------------<br>"; 
$lists->updateLink ( 3, "222222" ); 
$lists->getLinkList ();
echo "<br>-----------获取节点名称--------------<br>"; 
echo $lists->getLinkNameById ( 5 );
echo "<br>-----------获取链表长度--------------<br>"; 
echo $lists->getLinkLength ();

The above is the detailed content of How to implement singly linked list in php. For more information, please follow other related articles on the PHP Chinese website!