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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
| /*
Singly LinkedList C++
*/
#include <iostream>
#include <string>
using namespace std;
typedef int ElementType;
class SLList
{
public:
SLList();//默认构造函数
SLList(const SLList& from);//复制构造函数
SLList& operator = (const SLList& from);//赋值操作符重载
~SLList();//析构函数
public://why separate
class SLNode
{
friend class SLList;
private:
SLNode();
SLNode(const ElementType& t);
~SLNode();
public:
ElementType m_data;
SLNode* m_next;
};
public://成员函数
bool empty(void) const { return m_size == 0; }//判断链表是否为空
int size(void) const { return m_size; }//返回链表元素的数量
const ElementType& get_element(int i) const;//获取链表的第i个元素(可能会抛异常)
ElementType& get_element(int i);//获取链表的第i个元素(可能会抛异常)
/* 在第i个元素之前插入e(可能会抛异常)
拥有n个元素的链表可以插入的位置有n+1个：0, 1, ... , n
插入位置为n表示插入在最后一个元素之后
*/
void insert(int i, const ElementType& e);
/* 查找某个元素是否存在，当发现第一个时就返回，所以返回SLNode*;
这个函数有3个作用:
1 查找元素是否存在；
2 读写元素；
3 相当于返回的是迭代器
*/
SLNode* find(const ElementType& e);
void delete_element(int i);//删除第i个元素(可能会抛异常)
void clear(void);//删除所有元素
private:
void copy(const SLList & from);
private:
/* 指向头节点，不存储元素；
next为空指针表示没有最后一个元素，也就是空链表;
方便代码编写
*/
SLNode m_head;
int m_size;//链表当前有多少个元素
};
SLList::SLNode::SLNode()
{
m_next = nullptr;
}
SLList::SLNode::SLNode(const ElementType &t)
{
m_data = t;
m_next = nullptr;
}
SLList::SLNode::~SLNode()
{
m_next = nullptr;
}
void SLList::insert(int i, const ElementType &e)
{
if(i < 0 || i > m_size)
{
throw runtime_error("Out of Index");
}
else
{
SLNode *p = &m_head;
int length = 0;
while (length < i && p != nullptr)
{
length++;
p = p->m_next;
}
SLNode *q = new SLNode(e);
q->m_next = p->m_next;
p->m_next = q;
m_size++;
}
}
void SLList::delete_element(int i)
{
if(i < 0 || i >= m_size)
{
throw runtime_error("Out of Index");
}
else
{
SLNode *p = &m_head;
int length = 0;
while (length < i && p != nullptr)
{
length++;
p = p->m_next;
}
SLNode *q = p->m_next;
p->m_next = q->m_next;
delete q;
m_size--;
}
}
SLList::SLList()
{
m_size = 0;
}
SLList::~SLList()
{
//clear();//libc++abi.dylib: terminating with uncaught exception of type std::runtime_error: Out of Index
}
void SLList::copy(const SLList &from)
{
auto old = &from.m_head;
auto current = &m_head;
for(int i = 0; i < from.m_size; i++)
{
auto p = new SLNode(old->m_next->m_data);
current->m_next = p;
current = p;
old = old->m_next;
}
m_size = from.m_size;
}
SLList::SLList(const SLList &from)
{
if(!from.empty())
{
copy(from);
}
}
const ElementType &SLList::get_element(int i) const
{
if(i < 0 || i > m_size)
{
throw runtime_error("Out of Index");
}
auto p = &m_head;
int length = 0;
while(length < i && p != nullptr)
{
length++;
p = p->m_next;
}
return p->m_next->m_data;
}
ElementType &SLList::get_element(int i)
{
if(i < 0 || i > m_size)
{
throw runtime_error("Out of Index");
}
auto p = &m_head;
int length = 0;
while(length < i && p != nullptr)
{
length++;
p = p->m_next;
}
return p->m_next->m_data;
}
SLList &SLList::operator=(const SLList &from)
{
std::cout << "SLListInt & DLListInt::operator=(const SLListInt & from)\n";
if (this == &from)
{
return *this;
}
else
{
copy(from);
return *this;
}
}
SLList::SLNode *SLList::find(const ElementType &e)
{
SLNode *p = &m_head;
while(p)
{
if(p->m_data == e)
{
return p;
}
p = p->m_next;
}
return nullptr;
/*
SLNode *p = &m_head;
while(p->next)
{
if(p->m_next->m_data == e)
{
return p->m_next;
}
p = p->m_next;
}
return nullptr;
*/
}
void SLList::clear()
{
SLNode *p = &m_head;
while(p)
{
auto q = p->m_next;
p = q->m_next;
delete q;
}
m_head.m_next = nullptr;
m_size = 0;
}
void print_list(const SLList& slist, const std::string& msg)
{
cout << "print " << msg << ":";
for (int i = 0; i < slist.size(); ++i)
{
cout << slist.get_element(i) << " ";
}
cout << "\n";
}
void Check(bool b)
{
if (b)
{
std::cout << "Pass" << std::endl;
}
else
{
std::cout << "NOT Pass" << std::endl;
}
}
int main()
{
{
//test empty/size;
cout << "test empty/size" << std::endl;
SLList slist;
Check(slist.size() == 0);
Check(slist.empty());
slist.insert(0, 1);
Check(slist.size() == 1);
Check(slist.empty() == false);
}
{
//test insert/get_element/find;
std::cout << "test insert/get_element/find" << std::endl;
SLList slist;
cout << "1";
Check(slist.size() == 0);
cout << "2";
Check(slist.empty());
try
{
slist.get_element(-1);
}
catch (const std::exception& e)
{
std::cout<<"Pass " << e.what() << std::endl;
}
cout << "3";
Check(slist.find(123) == nullptr);
slist.insert(0, 123);
cout << "4";
Check(slist.find(123) && slist.find(123)->m_data == 123);
cout << "5";
Check(slist.size() == 1);
cout << "6";
Check(slist.empty() == false);
cout << "7";
Check(slist.get_element(0) == 123);
slist.insert(1, 456);
cout << "8";
Check(slist.find(456) && slist.find(456)->m_data == 456);
cout << "9";
Check(slist.get_element(0) == 123);
cout << "10";
Check(slist.get_element(1) == 456);
cout << "11";
Check(slist.size() == 2);
try
{
slist.get_element(2);
}
catch (const std::exception& e)
{
std::cout << "Pass " << e.what() << std::endl;
}
slist.get_element(1) = 789;
cout << "12";
Check(slist.get_element(1) == 789);
cout << "13";
Check(slist.find(789) && slist.find(789)->m_data == 789);
}
{
//test delete_element;
std::cout << "test delete_element" << std::endl;
SLList slist;
try
{
slist.delete_element(0);
}
catch (const std::exception& e)
{
std::cout << "Pass " << e.what() << std::endl;
}
slist.insert(0, 123);
cout << "1";
Check(slist.find(123) && slist.find(123)->m_data == 123);
slist.delete_element(0);
cout << "2";
Check(slist.size() == 0);
cout << "3";
Check(slist.empty());
slist.insert(0, 123);
slist.insert(1, 456);
slist.insert(2, 789);
slist.insert(3, 101112);
slist.insert(4, 131415);
print_list(slist, "5个整数");
slist.delete_element(slist.size() - 1);
print_list(slist, "删除最后一个，剩4个整数");
slist.delete_element(0);
print_list(slist, "删除第1个，剩3个整数");
slist.delete_element(1);
print_list(slist, "删除第2个，剩2个整数");
slist.delete_element(0);
slist.delete_element(0);
print_list(slist, "全部删除后");
}
{
//test clear;
std::cout << "test clear" << std::endl;
SLList slist;
slist.insert(0, 123);
slist.insert(1, 456);
slist.insert(2, 789);
slist.insert(3, 101112);
slist.insert(4, 131415);
print_list(slist, "5个整数");
slist.clear();
print_list(slist, "全部删除后");
}
{
//test copy;
std::cout << "test copy" << std::endl;
SLList slist;
slist.insert(0, 123);
slist.insert(1, 456);
slist.insert(2, 789);
slist.insert(3, 101112);
slist.insert(4, 131415);
print_list(slist, "slist 5个整数");
{
SLList slist2(slist);
print_list(slist2, "slist2 5个整数");
}
{
SLList slist3;
slist3 = slist;
print_list(slist3, "slist3 5个整数");
}
slist.clear();
print_list(slist, "全部删除后");
}
}
|