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
|
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
typedef struct list
{
int key;
struct list *next;
} mlist;
mlist *head;
mlist* search_list(mlist *l, int k)
{
l = head;
while(l!=NULL && l->key!=k)
{
l = l->next;
}
return l;
}
int delete_list(mlist *l)
{
mlist *tmp;
tmp = head;
if (head != l)
{
while(tmp->next!=l)
tmp = tmp->next;
tmp->next = l->next;
}
else
{
head = l->next;
}
free(l);
return 0;
}
int insert_list(mlist *l, int k)
{
l = (mlist*)malloc(sizeof(mlist));
if (head==NULL)
{
l->key = k;
l->next = NULL;
}
else
{
l->key = k;
l->next = head;
}
head = l;
return 0;
}
int main(void)
{
int i;
mlist *mylist, *temp;
insert_list(mylist,2);
insert_list(mylist,5);
insert_list(mylist,1);
insert_list(mylist,3);
mylist = head;
temp = search_list(mylist,2);
assert(temp->key == 2);
delete_list(temp);
}
|
