当前位置： 移动技术网 > IT编程>开发语言>PHP > PHP小教程之实现双向链表

PHP小教程之实现双向链表

2019年03月24日  | 移动技术网IT编程  | 我要评论

看了很久数据结构但是没有怎么用过，在网上看到了关于php的数据结构，学习了一下，与大家一起分享一下。上一次分享了《php小教程之实现链表》，这次来补充说一下双向链表。

复制代码 代码如下:

<?php
        class hero
        {
            public $pre=null;
            public $no;
            public $name;
            public $next=null;
            public function __construct($no='',$name='')
            {
                $this->no=$no;
                $this->name=$name;
            }
            static public function addhero($head,$hero)
            {
                $cur = $head;
                $isexist=false;
                //判断目前这个链表是否为空
                if($cur->next==null)
                {
                    $cur->next=$hero;
                    $hero->pre=$cur;
                }
                else
                {
                    //如果不是空节点，则安排名来添加
                    //找到添加的位置
                    while($cur->next!=null)
                    {
                        if($cur->next->no > $hero->no)
                        {
                            break;
                        }
                        else if($cur->next->no == $hero->no)
                        {
                            $isexist=true;
                            echo "<br>不能添加相同的编号";
                        }
                        $cur=$cur->next;
                    }
                    if(!$isexist)
                    {
                        if($cur->next!=null)
                        {
                            $hero->next=$cur->next;
                        }
                        $hero->pre=$cur;
                        if($cur->next!=null)
                        {
                            $hero->next->pre=$hero;
                        }
                        $cur->next=$hero;                   
                    }
                }
            }
            //遍历
            static public function showhero($head)
            {
                $cur=$head;
                while($cur->next!=null)
                {
                    echo "<br>编号：".$cur->next->no."名字：".$cur->next->name;
                    $cur=$cur->next;
                }
            }
            static public function delhero($head,$herono)
            {
                $cur=$head;
                $isfind=false;
                while($cur!=null)
                {
                    if($cur->no==$herono)
                    {
                        $isfind=true;
                        break;
                    }
                    //继续找
                    $cur=$cur->next;
                }
                if($isfind)
                {
                    if($cur->next!=null)
                    {
                        $cur->next_pre=$cur->pre;
                    }
                    $cur->pre->next=$cur->next;
                }
                else
                {
                    echo "<br>没有找到目标";
                }               
            }
        }
        $head = new hero();
        $hero1 = new hero(1,'1111');
        $hero3 = new hero(3,'3333');
        $hero2 = new hero(2,'2222');
        hero::addhero($head,$hero1);
        hero::addhero($head,$hero3);
        hero::addhero($head,$hero2);
        hero::showhero($head);
        hero::delhero($head,2);
        hero::showhero($head);
?>

您可能感兴趣的文章:

如对本文有疑问， 点击进行留言回复！！

相关文章:

验证码：
最近更新的文章
大家感兴趣的文章
移动技术网