php實現單鏈表的執行個體代碼_PHP教程

來源:互聯網
上載者:User
複製代碼 代碼如下:

//鏈表節點
class node {
public $id; //節點id
public $name; //節點名稱
public $next; //下一節點

public function __construct($id, $name) {
$this->id = $id;
$this->name = $name;
$this->next = null;
}
}

//單鏈表
class singelLinkList {
private $header; //鏈表前端節點

//構造方法
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;
}

//添加節點資料
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;
}

//刪除鏈表節點
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 . "的節點!
";
}
}

//擷取鏈表
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 . "
";
if ($current->next->next == null) {
break;
}
$current = $current->next;
}
}

//擷取節點名字
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;
}

//更新節點名稱
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 "
-----------刪除節點--------------
";
$lists->delLink ( 5 );
$lists->getLinkList ();

echo "
-----------更新節點名稱--------------
";
$lists->updateLink ( 3, "222222" );
$lists->getLinkList ();

echo "
-----------擷取節點名稱--------------
";
echo $lists->getLinkNameById ( 5 );

echo "
-----------擷取鏈表長度--------------
";
echo $lists->getLinkLength ();
?>

http://www.bkjia.com/PHPjc/326722.htmlwww.bkjia.comtruehttp://www.bkjia.com/PHPjc/326722.htmlTechArticle複製代碼 代碼如下: ?php //鏈表節點 class node { public $id; //節點id public $name; //節點名稱 public $next; //下一節點 public function __construct($id, $name)...

  • 聯繫我們

    該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

    如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

    A Free Trial That Lets You Build Big!

    Start building with 50+ products and up to 12 months usage for Elastic Compute Service

    • Sales Support

      1 on 1 presale consultation

    • After-Sales Support

      24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.