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
|
#include "list.h"
/* Fundamental */
void initList(List * L)
{
L->lin = NULL;
}
int lengthList(List * L)
{
linkList tmp = L->lin;
int i = 0;
while (tmp)
{
i++;
tmp = tmp->next;
}
return i;
}
bool locateElem(List * L, int * i, int e)
{
linkList tmp = L->lin;
*i = 1;
while (tmp)
{
if (tmp->elem != e)
{
(*i)++;
tmp = tmp->next;
}
else
return true;
}
return false;
}
bool getElem(List * L, int i, int * e)
{
linkList tmp = L->lin;
for (int j = 1; j < i; j++)
if(tmp->next)
tmp = tmp->next;
else
{
fprintf(stderr,"Location is out of range\n");
return false;
}
*e = tmp->elem;
return true;
}
bool insertElem(List * L, int i, int e)
{
if (i <= 0)
{
fprintf(stderr,"Invalid location!\n");
return false;
}
linkList scan = L->lin;
linkList new = (Link *) malloc (sizeof(Link));
new->elem = e;
new->next = NULL;
if (!L->lin)
{
L->lin = new;
return true;
}
else
{
if (i == 1)
{
new->next = scan;
L->lin = new;
}
else
{
int j = 2;
while (j++ < i && scan->next)
scan = scan->next;
if (!scan->next && --j < i)
printf("Location is beyond the list length, Append element\n");
new->next = scan->next;
scan->next = new;
}
}
return true;
}
bool deleteElem(List * L, int i, int * e)
{
linkList tmp = L->lin;
if (i == 1)
{
*e = tmp->elem;
L->lin = L->lin->next;
free(tmp);
return true;
}
int j = 2; // we need the one before the one needs delete
while (j++ < i && tmp->next)
tmp = tmp->next;
if (!tmp->next)
{
fprintf(stderr,"location out of range\n");
return false;
}
*e = tmp->next->elem;
if (tmp->next)
{
linkList t = tmp->next;
tmp->next = t->next;
free(t);
}
else
free(tmp);
return true;
}
void printList(List * L)
{
linkList tmp = L->lin;
while (tmp)
{
printf("%d ",tmp->elem);
tmp = tmp->next;
}
putchar('\n');
}
void deleteList(List * L)
{
linkList tmp = L->lin;
linkList del;
while (tmp)
{
del = tmp->next;
free(tmp);
tmp = del;
}
}
/* Homework */
void deleteX(linkList * L, int e)
{
linkList tmp = *L;
if (!tmp->next)
return;
else
{
if (tmp->elem == e)
{
(*L) = (*L)->next;
free(tmp);
deleteX(&(*L)->next,e);
}
else if (tmp->next->elem == e)
{
linkList p = tmp->next;
tmp->next = p->next;
free(p);
deleteX(&tmp,e);
}
else
deleteX(&tmp->next,e);
}
}
|
