时时商务社区
标题:
php单链表实现代码分享
[打印本页]
作者:
bewin83
时间:
2018-2-14 05:34
本文实例为大家分享了php单链表的具体代码,供大家参考,具体内容如下
id = $id;
$this->name = $name;
}
static public function show ($head)
{
$cur = $head;
while ($cur->next) {
echo $cur->next->id,'###',$cur->next->name,'
';
$cur = $cur->next;
}
echo '';
}
//尾插法
static public function push ($head, $node)
{
$cur = $head;
while (NULL != $cur->next) {
$cur = $cur->next;
}
$cur->next = $node;
return $head;
}
static public function insert($head, $node)
{
$cur = $head;
while (NULL != $cur->next) {
if ($cur->next->id > $node->id) {
break;
}
$cur = $cur->next;
}
$node->next = $cur->next;
$cur->next = $node;
return $head;
}
static public function edit($head, $node)
{
$cur = $head;
while (NULL != $cur->next) {
if ($cur->next->id == $node->id) {
break;
}
$cur = $cur->next;
}
$cur->next->name = $node->name;
return $head;
}
static public function pop ($head, $node)
{
$cur = $head;
while (NULL != $cur->next) {
if ($cur->next == $node) {
break;
}
$cur = $cur->next;
}
$cur->next = $node->next;
return $head;
}
}
$team = new Demo();
$node1 = new Demo(1, '唐三藏');
Demo::push($team, $node1);
$node1->name = '唐僧';
Demo::show($team);
// Demo::show($team);
$node2 = new Demo(2, '孙悟空');
Demo::insert($team, $node2);
// Demo::show($team);
$node3 = new Demo(5, '白龙马');
Demo::push($team, $node3);
// Demo::show($team);
$node4 = new Demo(3, '猪八戒');
Demo::insert($team, $node4);
// Demo::show($team);
$node5 = new Demo(4, '沙和尚');
Demo::insert($team, $node5);
// Demo::show($team);
$node4->name = '猪悟能';//php对象传引用,所以Demo::edit没有必要
// unset($node4);
// $node4 = new Demo(3, '猪悟能');
// Demo::edit($team, $node4);
Demo::pop($team, $node1);
Demo::show($team);
以上就是本文的全部内容,希望对大家实现php单链表有所帮助。
您可能感兴趣的文章:
约瑟夫环问题的PHP实现 使用PHP数组内部指针操作函数
php实现单链表的实例代码
php解决约瑟夫环示例
php约瑟夫问题解决关于处死犯人的算法
php实现约瑟夫问题的方法小结
浅谈PHP链表数据结构(单链表)
PHP单链表的实现代码
PHP链表操作简单示例
PHP基于递归实现的约瑟夫环算法示例
PHP使用栈解决约瑟夫环问题算法示例
PHP实现的基于单向链表解决约瑟夫环问题示例
欢迎光临 时时商务社区 (http://bbs.4435.cn/)
Powered by Discuz! X3.2