php實現(xiàn)鏈表的方法：首先定義一個節(jié)點類，代碼為【function __construct($val=null)】；然后實現(xiàn)鏈表的實現(xiàn)類，代碼為【function_construct $this->dummyhead = new Nod】。

php實現(xiàn)鏈表的方法：

首先定義一個節(jié)點類

class Node{     public $val;     public $next;     function __construct($val=null){         $this->val = $val;         $this->next = null;     } }

鏈表的實現(xiàn)類

class MyLinkedList {     public $dummyhead; //定義一個虛擬的頭結(jié)點     public $size;        function __construct() {         $this->dummyhead = new Node();          $this->size = 0;     }          function get($index) {         if($index < 0 || $index >= $this->size)             return -1;         $cur = $this->dummyhead;         for($i = 0; $i < $index; $i++){             $cur = $cur->next;         }         return $cur->next->val;     }        function addAtHead($val) {         $this->addAtIndex(0,$val);     }           function addAtTail($val) {         $this->addAtIndex($this->size,$val);     }        function addAtIndex($index, $val) {         if($index < 0 || $index > $this->size)             return;         $cur = $this->dummyhead;         for($i = 0; $i < $index; $i++){             $cur = $cur->next;         }         $node = new Node($val);         $node->next = $cur->next;         $cur->next = $node;         $this->size++;     }        function deleteAtIndex($index) {         if($index < 0 || $index >= $this->size)             return;         $cur = $this->dummyhead;         for($i = 0; $i < $index; $i++){             $cur = $cur->next;         }         $cur->next = $cur->next->next;         $this->size--;     } }

相關(guān)學習推薦：PHP編程從入門到精通