php實現(xiàn)單鏈表的實例代碼
<?php
//鏈表節(jié)點
class node {
public $id; //節(jié)點id
public $name; //節(jié)點名稱
public $next; //下一節(jié)點
public function __construct($id, $name) {
$this->id = $id;
$this->name = $name;
$this->next = null;
}
}
//單鏈表
class singelLinkList {
private $header; //鏈表頭節(jié)點
//構(gòu)造方法
public function __construct($id = null, $name = null) {
$this->header = new node ( $id, $name, null );
}
//獲取鏈表長度
public function getLinkLength() {
$i = 0;
$current = $this->header;
while ( $current->next != null ) {
$i ++;
$current = $current->next;
}
return $i;
}
//添加節(jié)點數(shù)據(jù)
public function addLink($node) {
$current = $this->header;
while ( $current->next != null ) {
if ($current->next->id > $node->id) {
break;
}
$current = $current->next;
}
$node->next = $current->next;
$current->next = $node;
}
//刪除鏈表節(jié)點
public function delLink($id) {
$current = $this->header;
$flag = false;
while ( $current->next != null ) {
if ($current->next->id == $id) {
$flag = true;
break;
}
$current = $current->next;
}
if ($flag) {
$current->next = $current->next->next;
} else {
echo "未找到id=" . $id . "的節(jié)點!<br>";
}
}
//獲取鏈表
public function getLinkList() {
$current = $this->header;
if ($current->next == null) {
echo ("鏈表為空!");
return;
}
while ( $current->next != null ) {
echo 'id:' . $current->next->id . ' name:' . $current->next->name . "<br>";
if ($current->next->next == null) {
break;
}
$current = $current->next;
}
}
//獲取節(jié)點名字
public function getLinkNameById($id) {
$current = $this->header;
if ($current->next == null) {
echo "鏈表為空!";
return;
}
while ( $current->next != null ) {
if ($current->id == $id) {
break;
}
$current = $current->next;
}
return $current->name;
}
//更新節(jié)點名稱
public function updateLink($id, $name) {
$current = $this->header;
if ($current->next == null) {
echo "鏈表為空!";
return;
}
while ( $current->next != null ) {
if ($current->id == $id) {
break;
}
$current = $current->next;
}
return $current->name = $name;
}
}
$lists = new singelLinkList ();
$lists->addLink ( new node ( 5, 'eeeeee' ) );
$lists->addLink ( new node ( 1, 'aaaaaa' ) );
$lists->addLink ( new node ( 6, 'ffffff' ) );
$lists->addLink ( new node ( 4, 'dddddd' ) );
$lists->addLink ( new node ( 3, 'cccccc' ) );
$lists->addLink ( new node ( 2, 'bbbbbb' ) );
$lists->getLinkList ();
echo "<br>-----------刪除節(jié)點--------------<br>";
$lists->delLink ( 5 );
$lists->getLinkList ();
echo "<br>-----------更新節(jié)點名稱--------------<br>";
$lists->updateLink ( 3, "222222" );
$lists->getLinkList ();
echo "<br>-----------獲取節(jié)點名稱--------------<br>";
echo $lists->getLinkNameById ( 5 );
echo "<br>-----------獲取鏈表長度--------------<br>";
echo $lists->getLinkLength ();
?>
相關(guān)文章
php遞歸函數(shù)三種實現(xiàn)方法及如何實現(xiàn)數(shù)字累加
實現(xiàn)遞歸函數(shù)有哪些方法呢?如何用遞歸函數(shù)實現(xiàn)數(shù)字累加?這篇文章就主要介紹php遞歸函數(shù)三種實現(xiàn)方法及如何實現(xiàn)數(shù)字累加,需要的朋友可以參考下。2015-08-08CentOS 上搭建 PHP7 開發(fā)測試環(huán)境
本文給大家分享的是作者在centos上搭建部署php7的開發(fā)測試環(huán)境的全部過程,非常的細致,有需要的小伙伴可以參考下2017-02-02