blob: fc4cf8aa30189cb01e49c92c6b70f99b6a9acb63 (
plain)
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
|
#include "list.h"
void InitList (List * L)
{
*L = (LNode *) malloc (sizeof(LNode));
if (!*L)
{
fprintf(stderr,"Initialization Failed\n");
exit(EXIT_FAILURE);
}
(*L)->next = NULL;
printf("Initialization Successful!\n");
}
void DestroyList (List * L)
{
// reserve head pointer
List T = *L;
List tmp;
if (!T->next)
printf("No element in list!\n");
else
{
while (T->next)
{
tmp = T->next->next;
free(T->next);
T->next = tmp;
}
if (!T->next)
printf("Destroyed list!\n");
else
printf("Error during destroy list");
}
}
bool AddElem (List * L, ElemType e)
{
List new = *L;
while (new->next)
new = new->next;
new->next = (LNode *) malloc (sizeof(LNode));
if (!new)
return false;
new = new->next;
new->data = e;
new->next = NULL;
return true;
}
int ListLength (List * L)
{
int count = 0;
List tmp = *L;
while (tmp->next)
{
tmp = tmp->next;
count++;
}
return count;
}
ElemType GetElem (List * L, int i)
{
List tmp = *L;
for (int j = 1; j < i; j++)
tmp = tmp->next;
return tmp->next->data;
}
int LocateElem (List * L, ElemType e)
{
int i = 1;
List tmp = *L;
while (tmp->next && tmp->next->data != e)
{
tmp = tmp->next;
i++;
}
if (!tmp->next)
return 0;
return i;
}
ElemType PriorElem(List * L, ElemType e)
{
List tmp = *L;
while (tmp->next->data != e)
tmp = tmp->next;
return tmp->data;
}
ElemType NextElem(List * L, ElemType e)
{
List tmp = *L;
while (tmp->next->data != e)
tmp = tmp->next;
tmp = tmp->next->next;
return tmp->data;
}
bool InsertElem (List * L, ElemType e, int i)
{
List scan = *L;
List new;
int tmp = 1;
new = (LNode *) malloc (sizeof(LNode));
if (!new)
return false;
while (scan->next && tmp < i)
{
scan = scan->next;
tmp++;
}
if (!scan->next)
printf("Reached list end. Element appended on.\n");
new->data = e;
new->next = scan->next;
scan->next = new;
return true;
}
bool DeleteElem (List * L, int i)
{
List tmp1 = *L;
List tmp2 = tmp1->next;
for (int j = 1; j < i; j++)
{
tmp1 = tmp1->next;
tmp2 = tmp2->next;
}
if (!tmp2)
return false;
tmp1->next = tmp2->next;
free(tmp2);
return true;
}
void TraverseList (List * L)
{
int i = 1;
List tmp = (*L)->next;
if (!tmp)
printf("No element could be traversed!\n");
else
{
puts("Traverse list:");
while (tmp)
{
printf("Node %d:\t%d\n",i++,tmp->data);
tmp = tmp->next;
}
puts("Traverse done!\n");
}
}
void OperateMenu (void)
{
puts("List Operation Menu\n");
puts("\e[34ma. Add element b. Initialize list");
puts("c. List status d. Get element from specific position");
puts("e. Search element f. Find prior element");
puts("g. Find next element h. Insert an element");
puts("i. Delete an element j. Traverse list");
puts("k. Show Menu l. Destroy list");
puts("q. Quit");
}
|
