看了很久數據結構但是沒有怎麼用過,在網上看到了關於PHP的數據結構,學習了一下,與大家一起分享一下。
簡短不割
class Hero { public $no;//排名 public $name;//名字 public $next=null;//$next是一個引用,指向另外一個Hero的對象實例 public function __construct($no='',$name='') { $this->no=$no; $this->name=$name; } static public function showList($head) { $cur = $head; while($cur->next!=null) { echo "排名:".$cur->next->no.",名字:".$cur->next->name."<br>"; $cur = $cur->next; } }
//普通插入 static public function addHero($head,$hero) { $cur = $head; while($cur->next!=null) { $cur = $cur->next; } $cur->next=$hero; } //有序的鏈表的插入 static public function addHeroSorted($head,$hero) { $cur = $head; $addNo = $hero->no; while($cur->next->no <= $addNo) { $cur = $cur->next; } /*$tep = new Hero(); $tep = $cur->next; $cur->next = $hero; $hero->next =$tep;*/ $hero->next=$cur->next; $cur->next=$hero; } static public function deleteHero($head,$no) { $cur = $head; while($cur->next->no != $no && $cur->next!= null) { $cur = $cur->next; } if($cur->next->no != null) { $cur->next = $cur->next->next; echo "刪除成功<br>"; } else { echo "沒有找到<br>"; } } static public function updateHero($head,$hero) { $cur = $head; while($cur->next->no != $hero->no && $cur->next!= null) { $cur = $cur->next; } if($cur->next->no != null) { $hero->next = $cur->next->next; $cur->next = $hero; echo "更改成功<br>"; } else { echo "沒有找到<br>"; } } } //創建head頭 $head = new Hero(); //第一個 $hero = new Hero(1,'111'); //連接 $head->next = $hero; //第二個 $hero2 = new Hero(3,'333'); //連接 Hero::addHero($head,$hero2); $hero3 = new Hero(2,'222'); Hero::addHeroSorted($head,$hero3); //顯示 Hero::showlist($head); //刪除 Hero::deleteHero($head,4); //顯示 Hero::showlist($head); //更改 $hero4=new Hero(2,'xxx'); Hero::updateHero($head,$hero4); //顯示 Hero::showlist($head);
我是天王蓋地虎的分割線
有序的插入的話需要遍歷一遍鏈表,鏈表的一些知識就不介紹了哈。這裡主要分享一下代碼。
轉載請注明出處:http://www.cnblogs.com/yydcdut