链表的实现
数据结构第一个就是链表了,链表分为两种有直接的数组形式的顺序链,这里不讨论,什么array_push(),array_pop(),函数基本能满足日常的需求,但报告老板,我就是想装个X
上代码吧
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
<?php
/**
*@author:gongbangwei(18829212319@163.com)
*@version:1.0
*@date:2016-05-22
*单链表的基本操作
*1.初始化单链表 __construct()
*2.清空单链表 clearSLL()
*3.返回单链表长度 getLength()
*4.判断单链表是否为空 getIsEmpty()
*5.头插入法建表 getHeadCreateSLL()
*6.尾插入法建表 getTailCreateSLL()
*7.返回第$i个元素 getElemForPos()
*8.查找单链表中是否存在某个值的元素 getElemIsExist()
*9.单链表的插入操作 getInsertElem()
*10.遍历单链表中的所有元素 getAllElem()
*11.删除单链中第$i个元素 getDeleteElem()
*12.删除单链表所有重复的值 getElemUnique()
**/
header(
"content-type:text/html;charset=UTF-8"
);
class
LNode{
public
$mElem
;
public
$mNext
;
public
function
__construct(){
$this
->mElem=null;
$this
->mNext=null;
}
}
class
SingleLinkedList{
//头结点数据
public
$mElem
;
//下一结点指针
public
$mNext
;
//单链表长度
public
static
$mLength
=0;
public
function
__construct(){
$this
->mElem=null;
$this
->mNext=null;
}
//返回单链表长度
public
static
function
getLength(){
return
self::
$mLength
;
}
public
function
getIsEmpty(){
if
(self::
$mLength
==0 &&
$this
->mNext==null){
return
true;
}
else
{
return
false;
}
}
public
function
clearSLL(){
if
(self::
$mLength
>0){
while
(
$this
->mNext!=null){
$q
=
$this
->mNext->mNext;
$this
->mNext=null;
unset(
$this
->mNext);
$this
->mNext=
$q
;
}
self::
$mLength
=0;
}
}
public
function
getHeadCreateSLL(
$sarr
){
$this
->clearSLL();
if
(
is_array
(
$sarr
)
and
count
(
$sarr
)>0){
foreach
(
$sarr
as
$key
=>
$value
) {
$p
=
new
LNode;
$p
->mElem=
$value
;
$p
->mNext=
$this
->mNext;
$this
->mNext=
$p
;
self::
$mLength
++;
}
}
else
{
return
false;
}
return
true;
}
public
function
getTailCreateSLL(
$sarr
){
$this
->clearSLL();
if
(
is_array
(
$sarr
)
and
count
(
$sarr
)>0){
$q
=
$this
;
foreach
(
$sarr
as
$value
){
$p
=
new
LNode;
$p
->mElem=
$value
;
$p
->mNext=
$q
->mNext;
$q
->mNext=
$p
;
$q
=
$p
;
self::
$mLength
++;
}
}
else
{
return
false;
}
}
public
function
getElemForPos(
$i
){
if
(
is_numeric
(
$i
) &&
$i
<self::
$mLength
&&
$i
>0){
$p
=
$this
->mNext;
for
(
$j
=1;
$j
<
$i
;
$j
++) {
$q
=
$p
->mNext;
$p
=
$q
;
}
return
$p
->mElem;
}
else
{
return
null;
}
}
public
function
getElemIsExist(
$value
){
if
(
$value
){
$p
=
$this
;
while
(
$p
->mNext!=null
and
$p
->mElem!=value){
$q
=
$p
->mNext;
$p
=
$q
;
}
if
(
$p
->mElem==value){
return
true;
}
else
{
return
false;
}
}
}
public
function
getElemPosition(
$value
){
if
(
$value
){
$p
=
$this
;
$pos
=0;
while
(
$p
->mNext!=null
and
$p
->mElem!=
$value
){
$q
=
$p
->mNext;
$p
=
$q
;
$pos
++;
}
if
(
$p
->mElem==
$value
){
return
$pos
;
}
else
{
return
-1;
}
}
}
/*单链表的插入操作
*
*@param int $i 插入元素的位序,即在什么位置插入新的元素,从1开始
*@param mixed $e 插入的新的元素值
*@return boolean 插入成功返回true,失败返回false
*/
public
function
getInsertElem(
$i
,
$e
){
if
(
$i
<self::
$mLength
){
$j
=1;
$p
=
$this
;
}
else
{
return
false;
}
while
(
$p
->mNext!=null
and
$j
<
$i
){
$q
=
$p
->mNext;
$p
=
$q
;
$j
++;
}
$q
=
new
LNode;
$q
->mElem=
$e
;
$q
->mNext=
$p
->mNext;
$p
->mNext=
$q
;
self::
$mLength
++;
return
true;
}
/**
*删除单链中第$i个元素
*@param int $i 元素位序
*@return boolean 删除成功返回true,失败返回false
*/
public
function
getDeleteElem(
$i
){
if
(
$i
>self::
$mLength
||
$i
<1){
return
false;
}
else
{
$p
=
$this
;
$j
=1;
while
(
$j
<
$i
){
$p
=
$p
->mNext;
$j
++;
}
$q
=
$p
->mNext;
$p
->mNext=
$q
->mNext;
unset(
$q
);
self::
$mLength
--;
return
true;
}
}
public
function
getAllElem(){
$all
=
array
();
if
(!
$this
->getIsEmpty()){
$p
=
$this
->mNext;
while
(
$p
->mNext){
$all
[]=
$p
->mElem;
$p
=
$p
->mNext;
}
if
(
$p
->mElem)
$all
[]=
$p
->mElem;
return
$all
;
}
}
public
function
getElemUnique(){
if
(!
$this
->getIsEmpty()){
$p
=
$this
;
while
(
$p
->mNext!=null){
$q
=
$p
->mNext;
$ptr
=
$p
;
while
(
$q
->mNext!=null){
if
(
strcmp
(
$p
->mElem,
$q
->mElem)===0){
$ptr
->mNext=
$q
->mNext;
$q
->mNext=null;
unset(
$q
->mNext);
$q
=
$ptr
->mNext;
self::
$mLength
--;
}
else
{
$ptr
=
$q
;
$q
=
$q
->mNext;
}
}
//处理最后一个元素
if
(
strcmp
(
$p
->mElem,
$q
->mElem)===0){
$ptr
->mNext=null;
self::
$mLength
--;
}
$p
=
$p
->mNext;
}
//end of while
}
}
}
///test//
$node
=
new
SingleLinkedList;
$arr
=
array
(
'gbw'
,
'michael'
,
'php'
,
'js'
);
//$node->getHeadCreateSLL($arr);
//print_r($node->getAllElem());
$node
->getTailCreateSLL(
$arr
);
echo
$node
->getElemForPos(2);
$pos
=
$node
->getElemPosition(
'gbw'
);
echo
$pos
;
$node
->getDeleteElem(
$pos
);
$node
->getInsertElem(1,
'gbw2'
);
print_r(
$node
->getAllElem());
|