嵌入式 双向链表的头尾中插入法以及释放

1. BIN = DoubleListDemo
2. CC = gcc
3. SRC = DoubleList.c main.c
4. OBJS = DoubleList.o main.o
5. CFLAGS = -Wall -O2
6. $(BIN): $(OBJS)
7. $(CC) -o $(BIN) $(OBJS) $(CFLAGS)
8. $(OBJS): $(SRC)
9. gcc -c $(SRC) $(CFLAGS)
10. clean:
11. rm -rf *.o
12. rm -rf $(BIN)
13. distclean:
14. -rm *.o

BIN     =  DoubleListDemo
CC = gcc

SRC =  DoubleList.c main.c 
OBJS = DoubleList.o main.o

CFLAGS  =  -Wall -O2

$(BIN): $(OBJS)
        $(CC) -o $(BIN) $(OBJS) $(CFLAGS)
$(OBJS): $(SRC) 
        gcc -c $(SRC) $(CFLAGS)


clean:
        rm -rf *.o
        rm -rf $(BIN)
distclean:
        -rm *.o 

DoubleList.h

[cpp] viewplain copy print ?

1. #include <stdio.h>
2. #include <stdlib.h>
3. #include <string.h>
5. typedef int KEY;
6. typedef struct {
7. KEY key;
8. int date;
9. }DATE;
10. typedef structnode{
11. DATE date;
12. struct node *pre;
13. struct node *next;
14. }NODE;
15. typedef struct{
16. int num;
17. NODE *head;
18. NODE *tail;
19. }DOUBLE_LIST;
21. voidInitDoubleList(DOUBLE_LIST *list);
22. voidDoubleListPrint(DOUBLE_LIST list);
23. void PrintNode(NODE *node);
24. voidHeadInsterNode(DOUBLE_LIST *list, DATEdate);
25. void XInsterNode(DOUBLE_LIST*list, DATE date, int x);
26. voidTailInsterNode(DOUBLE_LIST *list, DATEdate);
27. voidHeadDeleteNode(DOUBLE_LIST *list);
28. void XDeleteNode(DOUBLE_LIST*list, KEY key);
29. voidTailDeleteNode(DOUBLE_LIST *list);
30. void FreeList(DOUBLE_LIST*list);

#include 
#include 

typedef int KEY;

typedef struct {
        KEY key;
        int date;
}DATE;

typedef struct node{
        DATE date;
        struct node * pre;
        struct node * next;
}NODE;

typedef struct{
        int num;
        NODE *head;
        NODE *tail;
}DOUBLE_LIST;


void InitDoubleList(DOUBLE_LIST *list);

void DoubleListPrint(DOUBLE_LIST list);
void PrintNode(NODE * node);

void HeadInsterNode(DOUBLE_LIST *list, DATE date);
void XInsterNode(DOUBLE_LIST *list, DATE date, int x);
void TailInsterNode(DOUBLE_LIST *list, DATE date);

void HeadDeleteNode(DOUBLE_LIST *list);
void XDeleteNode(DOUBLE_LIST *list, KEY key);
void TailDeleteNode(DOUBLE_LIST *list);

void FreeList(DOUBLE_LIST *list);

DoubleList.c

[cpp] viewplain copy print ?

1. #include "DoubleList.h"
3. voidInitDoubleList(DOUBLE_LIST *list)
4. {
5. list->head = NULL;
6. list->tail = NULL;
7. list->num = 0;
8. return ;
9. }
11. voidDoubleListPrint(DOUBLE_LIST list)
12. {
13. int i =0;
14. NODE * p = NULL;
15. p = list.head;
16. if(0 ==list.num){
17. printf("Your List isEmpty!\n");
18. return;
19. }
20. for(i = 0; i < list.num;i++){
21. PrintNode(p);
22. p = p->next;
23. }
24. return;
25. }
27. void PrintNode(NODE *node)
28. {
29. printf("key:%d\tdate:%d\n",node->date.key,node->date.date);
30. return;
31. }
33. voidHeadInsterNode(DOUBLE_LIST * list, DATEdate)
34. {
35. NODE * newnode = (NODE *)malloc(sizeof(NODE));
36. newnode->date.key = date.key;
37. newnode->date.date =date.date;
38. if(0 ==list->num){
39. newnode->next = NULL;
40. newnode->pre = NULL;
41. list->head = newnode;
42. list->tail = newnode;
43. list->num++;
44. return;
45. }
46. newnode->pre = NULL;
47. newnode->next = list->head;
48. list->head->pre = newnode;
49. list->head = newnode;
50. list->num++;
51. return;
52. }
54. void XInsterNode(DOUBLE_LIST*list, DATE date, int x)
55. {
56. int i;
57. NODE * newnode = NULL;
58. NODE * prenode = NULL;
59. NODE * nextnode = NULL;
60. if(x < 0 ||x >=list->num){
61. printf("X Inster: x is notright!\n");
62. return;
63. }
64. if(0 ==x){
65. HeadInsterNode(list, date);
66. return;
67. }
68. if(list->num == x -1){
69. TailInsterNode(list, date);
70. return;
71. }
72. prenode = NULL;
73. nextnode = list->head;
74. for(i = 0; i < x;i++){
75. prenode = nextnode;
76. nextnode = nextnode->next;
77. }
78. newnode = (NODE *)malloc(sizeof(NODE));
79. newnode->date.key = date.key;
80. newnode->date.date =date.date;
81. prenode->next = newnode;
82. newnode->pre = prenode;
83. newnode->next = nextnode;
84. nextnode->pre = newnode;
85. list->num++;
86. return ;
87. }
89. voidTailInsterNode(DOUBLE_LIST *list, DATEdate)
90. {
91. NODE * newnode = (NODE *)malloc(sizeof(NODE));
92. newnode->date.key = date.key;
93. newnode->date.date = date.date;
94. if(0 ==list->num){
95. newnode->next = NULL;
96. newnode->pre = NULL;
97. list->head = newnode;
98. list->tail = newnode;
99. list->num++;
100. return;
101. }
102. newnode->next = NULL;
103. newnode->pre = list->tail;
104. list->tail->next = newnode;
105. list->tail = newnode;
106. list->num++;
107. return;
108. }
110. voidHeadDeleteNode(DOUBLE_LIST *list)
111. {
112. NODE * tmpnode = NULL;
113. if(0 == list->num){
114. printf("%s:NoNode InList!\n",__FUNCTION__);
115. return;
116. }
117. if(1 ==list->num){
118. free(list->head);
119. list->head = NULL;
120. list->tail = NULL;
121. list->num = 0;
122. return ;
123. }
124. tmpnode = list->head;
125. list->head = list->head->next;
126. free(tmpnode);
127. tmpnode = NULL;
128. list->num--;
129. return ;
130. }
132. void XDeleteNode(DOUBLE_LIST*list, KEY key)
133. {
134. ;
135. }
137. voidTailDeleteNode(DOUBLE_LIST *list)
138. {
139. NODE * tmpnode = NULL;
140. if(0 == list->num){
141. printf("%s:NoNode InList!\n",__FUNCTION__);
142. return;
143. }
144. if(1 ==list->num){
145. free(list->head);
146. list->head = NULL;
147. list->tail = NULL;
148. list->num = 0;
149. return ;
150. }
151. tmpnode = list->tail;
152. list->tail = list->tail->pre;
153. list->tail->next = NULL;
154. free(tmpnode);
155. tmpnode = NULL;
156. list->num--;
157. return;
158. }
160. void FreeList(DOUBLE_LIST*list)
161. {
162. int i;
163. NODE * tmpnode = NULL;
164. int num;
165. num = list->num;
166. for(i = 0; i < num;i++){
167. tmpnode = list->head;
168. list->head =list->head->next;
169. free(tmpnode);
170. tmpnode = NULL;
171. list->num--;
172. }
173. list->head = NULL;
174. list->tail = NULL;
175. return;
176. }

#include "DoubleList.h"


void InitDoubleList(DOUBLE_LIST *list)
{
        list->head = NULL;
        list->tail = NULL;
        list->num = 0;

        return ;
}

void DoubleListPrint(DOUBLE_LIST list)
{
        int i = 0;
        NODE * p = NULL;

        p = list.head;
        
        if(0 == list.num){
                printf("Your List is Empty!\n");
                return;
        }
        
        for(i = 0; i < list.num; i++){
                PrintNode(p);
                p = p->next;
        }

        return;
}

void PrintNode(NODE * node)
{
        printf("key:%d\tdate:%d\n",node->date.key,node->date.date);
        
        return;
}

void HeadInsterNode(DOUBLE_LIST * list, DATE date)
{
        NODE * newnode = (NODE *)malloc(sizeof(NODE));

        newnode->date.key = date.key;
        newnode->date.date = date.date;

        if(0 == list->num){
                newnode->next = NULL;
                newnode->pre = NULL;
                list->head = newnode;
                list->tail = newnode;

                list->num++;

                return;
        }

        newnode->pre = NULL;
        newnode->next = list->head;
        list->head->pre = newnode;
        list->head = newnode;

        list->num++;

        return;
        
}

void XInsterNode(DOUBLE_LIST *list, DATE date, int x)
{
        int i;
        NODE * newnode = NULL;
        NODE * prenode = NULL;
        NODE * nextnode = NULL;

        if(x < 0 ||x >= list->num){
                printf("X Inster: x is not right!\n");
                return;
        }

        if(0 == x){
                HeadInsterNode(list, date);
                return;
        }

        if(list->num == x - 1){
                TailInsterNode(list, date);
                return;
        }
        prenode = NULL;
        nextnode = list->head;

        for(i = 0; i < x; i++){
                prenode = nextnode;
                nextnode = nextnode->next;
        }
        
        newnode = (NODE *)malloc(sizeof(NODE));

        newnode->date.key = date.key;
        newnode->date.date = date.date;
        
        prenode->next = newnode;
        newnode->pre = prenode;
        newnode->next = nextnode;
        nextnode->pre = newnode;
        
        list->num++;
        
        return ;
}

void TailInsterNode(DOUBLE_LIST *list, DATE date)
{
        NODE * newnode = (NODE *)malloc(sizeof(NODE));

        newnode->date.key = date.key;
        newnode->date.date = date.date;

        if(0 == list->num){
                newnode->next = NULL;
                newnode->pre = NULL;
                list->head = newnode;
                list->tail = newnode;

                list->num++;

                return;
        }

        newnode->next = NULL;
        newnode->pre = list->tail;
        list->tail->next = newnode;
        list->tail = newnode;

        list->num++;
        
        return;
}

void HeadDeleteNode(DOUBLE_LIST *list)
{
        NODE * tmpnode = NULL;
        
        if(0 == list->num ){
                printf("%s:No Node In List!\n",__FUNCTION__);
                return;
        }
        if(1 == list->num){
                free(list->head);
                list->head = NULL;
                list->tail = NULL;
                list->num = 0;
                return ;
        }
        
        tmpnode = list->head;
        list->head = list->head->next;
        free(tmpnode);
        tmpnode = NULL;
        list->num--;

        return ;
}

void XDeleteNode(DOUBLE_LIST *list, KEY key)
{
        ;
}

void TailDeleteNode(DOUBLE_LIST *list)
{
        NODE * tmpnode = NULL;
        
        if(0 == list->num ){
                printf("%s:No Node In List!\n",__FUNCTION__);
                return;
        }
        if(1 == list->num){
                free(list->head);
                list->head = NULL;
                list->tail = NULL;
                list->num = 0;
                return ;
        }
        
        tmpnode = list->tail;
        list->tail = list->tail->pre;
        list->tail->next = NULL;
        free(tmpnode);
        tmpnode = NULL;
        list->num--;
        
        return;
}

void FreeList(DOUBLE_LIST *list)
{
        int i;
        NODE * tmpnode = NULL;
        int num;

        num = list->num;
        
        for(i = 0; i < num; i++){
                tmpnode = list->head;
                list->head = list->head->next;
                free(tmpnode);
                tmpnode = NULL;
                list->num--;
        }

        list->head = NULL;
        list->tail = NULL;

        return;
}

main.c

[cpp] viewplain copy print ?

1. #include "DoubleList.h"
2. int main(int argc,char*argv[])
3. {
4. DOUBLE_LIST list;
5. int i;
6. DATE date[10];
7. for(i = 0; i < 10;i++){
8. date[i].key = i + 1;
9. date[i].date = i + 11;
10. }
11. #if1
12. printf("init listtest\n");
13. InitDoubleList(&list);
14. DoubleListPrint(list);
15. #endif
16. #if1
17. //Head inster test
18. printf("headinster test\n");
19. HeadInsterNode(&list,date[0]);
20. HeadInsterNode(&list, date[1]);
21. HeadInsterNode(&list,date[2]);
22. HeadInsterNode(&list, date[3]);
23. HeadInsterNode(&list,date[4]);
24. DoubleListPrint(list);
25. #endif
26. #if1
27. //tail inster test
28. printf("\ntailinster test\n");
29. TailInsterNode(&list,date[0]);
30. TailInsterNode(&list, date[1]);
31. TailInsterNode(&list,date[2]);
32. TailInsterNode(&list, date[3]);
33. TailInsterNode(&list,date[4]);
34. DoubleListPrint(list);
35. #endif
36. #if1
37. //x inster test
38. printf("\nxinster test\n");
39. XInsterNode(&list, date[5],5);
40. XInsterNode(&list, date[6], 6);
41. XInsterNode(&list, date[7],7);
42. XInsterNode(&list, date[8], 8);
43. XInsterNode(&list, date[9],9);
44. DoubleListPrint(list);
45. #endif
46. #if1
47. //head delete test
48. printf("\nheaddelete test\n");
49. HeadDeleteNode(&list);
50. HeadDeleteNode(&list);
51. HeadDeleteNode(&list);
52. HeadDeleteNode(&list);
53. HeadDeleteNode(&list);
54. DoubleListPrint(list);
55. #endif
56. #if 1
57. //tail deletetest
58. printf("\ntail deletetest\n");
59. TailDeleteNode(&list);
60. TailDeleteNode(&list);
61. TailDeleteNode(&list);
62. TailDeleteNode(&list);
63. TailDeleteNode(&list);
64. DoubleListPrint(list);
65. #endif
66. #if 1
67. //free listtest
68. printf("\nfree listtest\n");
69. FreeList(&list);
70. DoubleListPrint(list);
71. #endif
72. return 0;
73. }