php的单链表

参考地址:https://www.cnblogs.com/sunshineliulu/p/7717301.html

<?php
//数据结构
class Node{
    public $data;
    public $next;

    public function __construct($data)
    {
        $this->data = $data;
        $this->next = null;
    }
}

class SingleLinkedList{
    private $header;

    //生成头部节点
    public function __construct($data)
    {
        $this->header = new Node($data);
    }

    //查找
    public function find($item)
    {
        $current = $this->header;
        while($current->data != $item)
        {
            $current = $current->next;
        }

        return $current;
    }

    //插入节点
    public function insert($item , $new)
    {
        $newNode = new Node($new);
        $current = $this->find($item);
        $newNode->next = $current->next;
        $current->next = $newNode;

        return true;
    }

    // 更新节点
    public function update($old, $new) 
    {
        $current = $this->header;
        if ($current->next == null) 
        {
            echo "链表为空!";
            return;
        }

        while ($current->next != null) 
        {
            if ($current->data == $old) 
            {
                break;
            }
            $current = $current->next;
        }
        return $current->data = $new;
    }


    // 查找待删除节点的前一个节点
    public function findPrevious($item) 
    {
        $current = $this->header;
        while ($current->next != null && $current->next->data != $item) 
        {
            $current = $current->next;
        }

        return $current;
    }

    // 从链表中删除一个节点
    public function delete($item) 
    {
        $previous = $this->findPrevious($item);
        if ($previous->next != null) 
        {
            $previous->next = $previous->next->next;
        }
    }

    // findPrevious和delete的整合
    public function remove($item) {
        $current = $this->header;
        while ($current->next != null && $current->next->data != $item) {
            $current = $current->next;
        }
        if ($current->next != null) {
            $current->next = $current->next->next;
        }
    }

    // 清空链表
    public function clear() {
       $this->header = null;
    }

    // 显示链表中的元素
    public function display() 
    {
        $current = $this->header;
        if ($current->next == null) 
        {
            echo "链表为空!";
            return;
        }
        while ($current->next != null) {
            echo $current->next->data . "&nbsp;&nbsp;&nbsp";
            $current = $current->next;
        }
    }
}

$linkedList = new SingleLinkedList('header');
$linkedList->insert('header', 'China');
$linkedList->insert('China', 'USA');
$linkedList->insert('USA','England');
$linkedList->insert('England','Australia');
echo '链表为:';
$linkedList->display();
echo "</br>";
echo '-----删除节点USA-----';
echo "</br>";
$linkedList->delete('USA');
echo '链表为:';
$linkedList->display();
echo "</br>";
echo '-----更新节点England为Japan-----';
echo "</br>";
    $linkedList->update('England', 'Japan');
echo '链表为:';
$linkedList->display();
//echo "</br>";
//echo "-----清空链表-----";
//echo "</br>";
//$linkedList->clear();
//$linkedList->display();
?>

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值