php实现单链表的实例代码
时间:2021-01-19
来源:互联网
php实现单链表的实例代码,需要的朋友可以来php爱好者来参考一下
代码如下:
<?php
//链表节点
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 . "的节点!<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;
}
}
//获取节点名字
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 "<br>-----------删除节点--------------<br>";
$lists->delLink ( 5 );
$lists->getLinkList ();
echo "<br>-----------更新节点名称--------------<br>";
$lists->updateLink ( 3, "222222" );
$lists->getLinkList ();
echo "<br>-----------获取节点名称--------------<br>";
echo $lists->getLinkNameById ( 5 );
echo "<br>-----------获取链表长度--------------<br>";
echo $lists->getLinkLength ();
?>
以上就是php实现单链表的实例代码的全部内容,希望对你的学习有所帮助。
-
Web3 安全入门避坑指南(钱包被恶意多签风险分析) 时间:2025-04-30
-
比特币隔离钱包是什么?比特币隔离钱包有什么好处? 时间:2025-04-30
-
多重签名钱包是什么意思?多重签名钱包地址如何恢复? 时间:2025-04-30
-
MetaMask充值/提现/Swap/添加地址流程 时间:2025-04-30
-
什么是BTC 钱包?了解其定义、类型和用法 时间:2025-04-30
-
Rabby 与 MetaMask:哪个是更好的加密钱包? 时间:2025-04-30
今日更新
-
PHP实现单链表翻转操作示例
阅读:21
-
PHP实现单链表翻转操作示例
阅读:22
-
浅谈PHP链表数据结构(单链表)
阅读:23
-
英雄联盟手游2.0版本到来拳头爸爸又来削英雄了!
阅读:24
-
lol2021新赛季新征程稀有皮肤免费领
阅读:67
-
php线性表的入栈与出栈实例分析
阅读:24
-
php线性表顺序存储实现代码(增删查改)
阅读:20
-
DNF2021春节礼包光环属性介绍 1至35技能等级+1
阅读:28
-
dnf2021年春节礼包外观效果一览
阅读:25
-
dnf2021年春节礼包什么时候出
阅读:22