反转链表-PHP的实现

<?
//节点
class Node
{
    private $Data;//节点数据

    private $Next;//下一节点

    public function setData($value)
    {
        $this->Data=$value;
    }

    public function setNext($value)
    {
        $this->Next = $value;
    }

    public function getData()
    {
        return $this->Data;
    }

    public function getNext()
    {
        return $this->Next;
    }

    public function __construct($data, $next)
    {
        $this->setData($data);
        $this->setNext($next);
    }

}

//链表数据
class LinkList
{
    private $header;//头节点

    private $size;//长度

    public function getSize()
    {
        $i = 0;
        $node = $this->header;
        while ($node->getNext() != null) {
            $i++;
            $node = $node->getNext();
        }

        return $i;
    }

    public function setHeader($value)
    {
        $this->header = $value;
    }

    public function getHeader()
    {
        return $this->header;
    }

    public function __construct()
    {
        header("content-type:text/html; charset=utf-8");
        $this->setHeader(new Node(null,null));
    }

    /**
     *@author Marx
     *@param $data--要添加节点的数据
     *
     */
    public function add($data)
    {
        $node = $this->header;

        //var_dump($this->header);

        while($node->getNext() != null) {
            $node = $node->getNext();
        }

        $node->setNext(new Node($data,null));
    }

    /**
     *@author Marx
     *@param $data--要移除节点的数据
     *
     */
    public function removeAt($data)
    {
        $node = $this->header;

        if ($node->getNext() == null) {
            return;
        }

        while ($node->getData() != $data)
        {
            $node = $node->getNext();
        }

        $node->setData($node->getNext()->getData());


        $node->setNext($node->getNext()->getNext());
    }

    /**
     *@author Marx
     *@param 遍历
     *
     */
    public function get()
    {
        $node = $this->header;
        if ($node->getNext() == null) {
            print("数据集为空!");
            return;
        }

        while ($node->getNext() != null) {
            print('['.$node->getNext()->getData().'] -> m');
            if ($node->getNext()->getNext() == null){break;}
            $node = $node->getNext();
        }
    }

    /**
     *@author Marx
     *@param $data--要访问的节点的数据
     * @param 此方法只是演示不具有实际意义
     *
     */

    public function getAt($data)
    {
        $node = $this->header->getNext();

        if ($node->getNext() == null) {
            print("数据集为空!
");
            return;
        }

        while ($node->getData() != $data) {
            if ($node->getNext() == null) {break;}

            $node = $node->getNext();
        }

        return $node->getData();
    }

    /**
     *@author Marx
     *@param $value--需要更新的节点的原数据 --$initial---更新后的数据
     *
     */
    public function update($initial,$value)
    {
        $node = $this->header->getNext();

        if($node->getNext() == null) {
            print("数据集为空!
");

            return;
        }

        while ($node->getData() != $initial) {
            //var_dump($node->getData());
            //var_dump($initial);
            echo "
";

            if ($node->getNext() == null) {break;}

            $node = $node->getNext();
        }
        //var_dump($node->getData());
        //var_dump($value);

        $node->setData($value);

    }
}

//迭代反转
function ReverseList1(Node $pHeader)
{
    $q = $pHeader->getNext();//首节点没值 只能获取下一个节点 称为【当前节点】

    $p = null;//负责设置【当前】的下一个 next值

    while($q)//【当前】
    {
        $r = $q->getNext();//负责拿下一个

        $q->setNext($p);//负责设置【当前】

        $p = $q;//将【更改后的当前】的存下来

        $q = $r;//将一下节点赋给【当前】节点
    }

    $newNode = new Node(null, $p);

    return $newNode;
}

$lists = new LinkList();//创建链表数据

$lists->add(1);//增加节点数据 顺序按push来

$lists->add(2);

$lists->add(3);

$haedNode = $lists->getHeader();//获取全量节点

var_dump($haedNode);//当前节点数据

$haedNode2 = ReverseList1($haedNode);
var_dump($haedNode2);//反转节点数据

 反转链表流程图