单链表是一种链式存取的数据结构,用一组地址任意的存储单元存放线性表中的数据元素。
单链表简介
链表中的数据是以结点来表示的,每个结点的构成:元素(数据元素的映象) + 指针(指示后继元素存储位置),元素就是存储数据的存储单元,指针就是连接每个结点的地址数据。
关键代码如下所示:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
<?php /** * 单链表 */ class Demo { private $id ; public $name ; public $next ; public function __construct ( $id = '' , $name = '' ) { $this ->id = $id ; $this ->name = $name ; } static public function show ( $head ) { $cur = $head ; while ( $cur ->next) { echo $cur ->next->id, '###' , $cur ->next->name, '<br />' ; $cur = $cur ->next; } echo '<hr />' ; } //尾插法 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单链表的实现代码,希望对大家有所帮助,如果大家有任何疑问请给我留言,小编会及时回复大家的。在此也非常感谢大家对服务器之家网站的支持!
原文链接:http://www.cnblogs.com/laipiyang/p/5640337.html