链表的创建, 插入, 删除与查找

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
/*
链表 link list
创建链表
插入
删除
查找
*/
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LNode *List;
typedef struct LNode *NodePoint;
typedef int ElementType;
typedef struct LNode
{
ElementType Data;
struct LNode *Next;
} LNode;
// 1. 创建链表
List creatList(List l)
{
int i = 0;
srand((unsigned)time(NULL));
i = rand() % 100 + 1;
l = (List)malloc(sizeof(LNode));
NodePoint p, r;
r = l;
cout << endl;
cout << "i = " << i << endl;
for (; i < 100; i++)
{
p = (NodePoint)malloc(sizeof(LNode));
p->Data = rand() % 100 + 1;
r->Next = p;
r = p;
}
r->Next = nullptr;
return l;
}
// 2. 求表长
int Length(List l)
{
int i = 0;
while (l->Next)
{
l = l->Next;
i++;
}
cout << "the length of List = " << i << endl;
return i;
}
// 3. 按序号查找
List FindKth(int K, List l)
{
// K 必须在 1 和 链表长度之间
int i = 1;
//cout << "find start" << endl;
while (i < K && l != nullptr)
{
l = l->Next;
i++;
}
if (i == K)
{
return l;
}
else
{
cout << "can not find this th element in list" << endl;
return nullptr;
}
}
// 4. 按照值查找
NodePoint Find(ElementType X, List l)
{
while (l != nullptr)
{
if (X == l->Data)
return l;
l = l->Next;
}
cout << "can not find this value in List" << endl;
return nullptr;
}
// 5. 插入 在第 i-1 个节点后插入一个值为 x 的节点（1 <= i <= n+1）
List Insert(int i, ElementType x, List l)
{
int index = 1;
List p;
if (i == 1)
{
NodePoint X = (NodePoint)malloc(sizeof(LNode));
X->Data = x;
X->Next = l;
return X;
}
p = FindKth(i - 1, l);
if (p == nullptr)
{
cout << "插入序号 i 错误" << endl;
return l;
}
else
{
NodePoint X = (NodePoint)malloc(sizeof(LNode));
X->Data = x;
X->Next = p->Next;
p->Next = X;
return l;
}
}
// 6. 删除第 i 个节点
List Delete(int i, List l)
{
List p = l;
List s;
if (i == 1)
{
l = p->Next;
free(p);
return l;
}
p = FindKth(i - 1, l);
if(p==nullptr)
{
printf("不存在第 i-1= %d 个元素n", i - 1);
return l;
}
else if(p->Next==nullptr)
{
printf("不存在第 i =
%d 个元素n", i);
return l;
}
s = p->Next;
p->Next = s->Next;
free(s);
return l;
}
// 打印链表
void Print(List l)
{
NodePoint p;
p = l;
cout << endl;
printf("List = ");
while (p->Next != nullptr)
{
printf("%d ", p->Data);
p = p->Next;
}
cout << endl;
cout << "print end" << endl;
cout << endl;
}
void test(List l)
{
l = l->Next;
cout << "l=l->Next = " << l << endl;
}
int main()
{
List l;
int index = -2;
l = creatList(l);
Print(l);
int length = Length(l);
cout << l->Next->Data << endl;
while (index < 100)
{
List findKth;
findKth = FindKth(index, l);
index++;
}
NodePoint find;
find = Find(20, l);
if (find != nullptr)
cout << "find data = " << find->Data << endl;
index = 100;
while (index > 0)
{
l = Insert(index, -100, l);
index--;
}
Print(l);
index = 100;
while (index > 0)
{
l = Delete(index, l);
index--;
}
// Print(l);
return 0;
}