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 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253
| #include <stdio.h> #include <stdlib.h>
typedef int tElem; typedef struct Node { tElem data; int index; struct Node * prev; struct Node * next; } Node,*pNode;
pNode InitList(pNode list) { list = (pNode) malloc(sizeof(Node)); list->prev = NULL; list->next = NULL; list->index = 0; return list; }
int ListEmpty(pNode list) { pNode item = list; while (item->next != NULL) { item = item->next; } return item->index; }
void ListTraverse(pNode list) { pNode item = list->next; int count = 0; while (item != NULL) { count++; printf("链表的第 %d 个元素是 %d。\n",count,item->data); item = item->next; } }
pNode ListInsert(pNode list,tElem e) { int len = ListEmpty(list); pNode temp = (pNode) malloc(sizeof(Node)); temp->data = e; temp->index = ++len; temp->next = NULL;
pNode item = list; while (item->next != NULL) { item = item->next; } item->next = temp; temp->prev = item;
return list; }
int ListIsIn(pNode list,tElem e) { pNode item = list->next; while (item != NULL) { if(item->data == e) { return item->index; } item = item->next; } return 0; }
void getElem(pNode list,tElem e) { int index = ListIsIn(list,e); int len = ListEmpty(list); if(index == 1 && len == 1) { printf("元素 %d 是链表的唯一元素,无前后节点。\n",e); return; }
if(index) { pNode item = list->next; while (item != NULL) { if(item->data == e) { pNode prev = item->prev; pNode next = item->next;
if(index == 1 && len > 1) { printf("元素 %d 是链表的第一个元素,无前节点,后节点元素为 %d。\n",e,next->data); return; } if(index == len) { printf("元素 %d 是链表的最后一个元素,无后节点,前节点元素为 %d。\n",e,prev->data); return; } printf("元素 %d 的前节点元素是:%d,后节点元素是:%d。\n",e,prev->data,next->data); } item = item->next; } } else { printf("元素 %d 不在链表中!\n",e); }
}
pNode ListDelete(pNode list,tElem e) { int index = ListIsIn(list,e); int len = ListEmpty(list); if(index) { pNode item = list->next; while (item != NULL) { if(item->data == e) { if(index == len) { item->prev->next = NULL; } else { item->prev->next = item->next; item->next->prev = item->prev; } } item = item->next; } } else { printf("元素 %d 不在链表中!\n",e); } }
pNode ClearList(pNode list) { list->prev = NULL; list->next = NULL; return list; }
pNode DestroyList(pNode list) { free(list); return list; }
int main() { pNode list = NULL;
list = InitList(list); printf("初始化后,链表的长度为:%d\n\n",ListEmpty(list));
list = ListInsert(list,10); list = ListInsert(list,20); list = ListInsert(list,30); list = ListInsert(list,40);
ListTraverse(list); printf("\n");
getElem(list,10); getElem(list,20); getElem(list,40); getElem(list,50); printf("\n");
ListDelete(list,40); ListTraverse(list); printf("\n");
list = ClearList(list); printf("清空链表后,链表的长度为:%d\n",ListEmpty(list));
list = DestroyList(list);
return 0; }
|