#ifndef __LINKLIST__H_

#define __LINKLIST__H_

typedef int datatype_t;

typedef struct node 
{
	datatype_t data;
	struct node *next;
} linknode_t;

extern linknode_t *create_empty_linklist();

extern void insert_head_linklist(linknode_t *head,datatype_t data);

extern void insert_tail_linklist(linknode_t *head,datatype_t data);

extern void insert_order_linklist(linknode_t *head,datatype_t data);

extern void print_data_linklist(linknode_t *head);

extern void insert_desc_order_linklist(linknode_t *head,datatype_t data);

extern int is_empty_linklist(linknode_t *head);

extern int delete_data_linklist(linknode_t *head,datatype_t data);

extern void reverse_data_linklist(linknode_t *head);

extern void clean_up_linklist(linknode_t *head);

#endif
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

#include <stdio.h>
#include "linklist.h"
#include <stdlib.h>
#include <string.h>

linknode_t *create_empty_linklist()
{
	linknode_t *head = NULL;
	head = (linknode_t *)malloc(sizeof(linknode_t));
	if(NULL == head){
		printf("malloc failed!\n");
		return NULL;
	}
	memset(head,0,sizeof(linknode_t));
	return head;
}

void insert_head_linklist(linknode_t *head,datatype_t data)
{
	linknode_t *temp = NULL;
	temp = (linknode_t *)malloc(sizeof(linknode_t));
	if(NULL == temp){
		printf("malloc failed!\n");
	}
	temp->data = data;
	temp->next = head->next;
	head->next = temp;
}

void insert_tail_linklist(linknode_t *head,datatype_t data)
{
	linknode_t *p = head;
	linknode_t *temp = NULL;
	temp = (linknode_t *)malloc(sizeof(linknode_t));
	if(NULL == temp){
		printf("malloc failed!\n");
	}
	while(p->next != NULL)
	{
		p = p->next;
	}
	temp->data = data;
	temp->next = p->next;
	p->next = temp;
}

void insert_order_linklist(linknode_t *head,datatype_t data)
{
	linknode_t *p = head;
	linknode_t *temp = NULL;
	temp = (linknode_t *)malloc(sizeof(linknode_t));
	if(NULL == temp){
		printf("malloc failed!\n");
	}
	while(p->next != NULL && p->next->data < data)
	{
		p = p->next;
	}
	temp->data = data;
	temp->next = p->next;
	p->next = temp;

}

void insert_desc_order_linklist(linknode_t *head,datatype_t data)
{
	linknode_t *p = head;
	linknode_t *temp = NULL;
	temp = (linknode_t *)malloc(sizeof(linknode_t));
	if(NULL == temp){
		printf("malloc failed!\n");
	}
	while(p->next != NULL && p->next->data > data)
	{
		p = p->next;
	}
	temp->data = data;
	temp->next = p->next;
	p->next = temp;

}



void print_data_linklist(linknode_t *head)
{
	linknode_t *p = head;
	while(p->next != NULL)
	{
		printf("%d ",p->next->data);
		p = p->next;
	}
	printf("\n");
}

int is_empty_linklist(linknode_t *head)
{
	return NULL == head->next ? 1 : 0;
}

int delete_data_linklist(linknode_t *head,datatype_t data)
{
	int flag = 0;

	if(is_empty_linklist(head))
	{
		return -1;
	}
	linknode_t *p = head;
	linknode_t *q = NULL;
	while(p->next != NULL)
	{
		if(p->next->data == data)
		{
			q = p->next;
			p->next = q->next;
			free(q);
			q = NULL;
			flag = 1;
		}else
		{
			p = p->next;
		}
	}
	if(flag == 0){
		return -2;
	}else{
		printf("delete %d successful",data);
	}
	return 0;
}

void reverse_data_linklist(linknode_t *head)
{
	if(is_empty_linklist(head)){
		return;
	}
	linknode_t *p = NULL;
	linknode_t *q = NULL;

	p = head->next->next;
	head->next->next = NULL;
	while(p != NULL)
	{
		q = p->next;
		p->next = head->next;
		head->next = p;
		p = q;
	}
}

void clean_up_linklist(linknode_t *head)
{
	linknode_t *p = NULL;
	linknode_t *q = NULL;
	p = head;
	while(p != NULL)
	{
		q = p->next;
		print_data_linklist(p);
		free(p);
		p = q;
	}
}
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

#include <stdio.h>
#include "linklist.h"

int main(int argc, const char *argv[])
{
	linknode_t *head = create_empty_linklist();
	if(NULL == head)
	{
		return -1;
	}
	insert_tail_linklist(head,1);
	insert_tail_linklist(head,5);
	insert_tail_linklist(head,3);
	insert_tail_linklist(head,7);
	insert_tail_linklist(head,9);
	print_data_linklist(head);

	reverse_data_linklist(head);
	printf("逆序后的链表\n");
	print_data_linklist(head);
	printf("执行清除链表\n");
	clean_up_linklist(head);
	printf("清除完成之后打印\n");
	print_data_linklist(head);
	return 0;
}
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