-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
103 lines (93 loc) · 1.82 KB
/
list.c
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
#include <stdio.h>
#include <stdlib.h>
struct element {
char data;
struct element *next;
};
struct element *new()
{
return ((struct element *) malloc(sizeof(struct element)));
}
struct element *create()
{
struct element *p;
p = new();
p->data = '!';
p->next = NULL;
return(p);
}
void insert(struct element *l, int k, char item)
{
struct element *p;
struct element *tmp;
tmp = l;
for (int i = 0; i < k - 1; i++) {
tmp = tmp->next;
}
p = new();
p->data = item;
p->next = tmp->next;
tmp->next = p;
}
void delete(struct element *l, int k)
{
struct element *next;
struct element *tmp;
tmp = l;
for (int i = 0; i < k - 1; i++) {
tmp = tmp->next;
}
next = tmp->next;
tmp->next = tmp->next->next;
free(next);
}
char access(struct element *l, int k)
{
struct element *tmp;
tmp = l;
for (int i = 0; i < k - 1; i++) {
tmp = tmp->next;
}
return(tmp->next->data);
}
void reverse(struct element *l)
{
struct element *back, *p, *next;
if (l->next == NULL || l->next->next == NULL) return;
p = l->next;
next = p->next;
p->next = NULL;
while (next) {
back = p;
p = next;
next = p->next;
p->next = back;
}
l->next = p;
}
void print(struct element *l)
{
int i;
struct element *p;
p = l->next;
for (i = 0; i < 20; i++) {
if (p != NULL) {
printf("%c -> ", p->data);
p = p->next;
} else {
printf("NULL\n");
return;
}
}
printf("...\n");
}
int main(void) {
struct element *p;
p = create(); print(p);
insert(p, 1, 'a'); print(p);
insert(p, 2, 'b'); print(p);
insert(p, 3, 'c'); print(p);
reverse(p); print(p);
delete(p, 2); print(p);
return 0;
}