[c/c++] C数据结构: 链表 Linked List

#include typedef int ElemType; 5 6 typedef struct node { 7 ElemType data; 8struct node *next; 9 } *LNode, *LinkList;LinkList 13 initLinkList(int n) { 14LinkList list = NULL; 15 ElemType e; 16 LNode p,r; i; 19for(i = 1; i <= n; i++) {,&e); 21p = (LinkList) malloc(sizeof(LNode)); 22p->data = e; 23p->next = NULL; 24if(!list) list = p; 25else r->next = p; }list; }printLinkList(LinkList *L) { 35while(*L) {,(*L)->data); 37(*L) = (*L)->next; 38 }); 40 }insertLinkListNode(LinkList *list,LNode insertNode,ElemType item) { 45 LinkList newNode; 46newNode = (LNode) malloc(sizeof(LNode)); 47newNode->data = item; 48if(!*list) { 49*list = newNode; 50newNode->next = NULL; 51} else {newNode->next = insertNode->next; insertNode->next = newNode; 55// 插入到开始位置 测试一下 有段错误 可能问题在main 56//*list = newNode; } 59 }deleteLinkListNode(LinkList *list,LNode deleteNode) { 63 LNode currentNode;*list = deleteNode->next; 66 free(deleteNode); 67} else { 68for(currentNode = *list; currentNode->next != deleteNode; currentNode = currentNode->next);currentNode->next = deleteNode->next; 71 free(deleteNode); 72 } 73 } 74 }destroyLinkList(LinkList *list) { 78 LNode currentNode,nextNode; 79currentNode = *list; 80while(currentNode) { 81nextNode = currentNode->next; 82 free(currentNode); 83currentNode = nextNode; 84 } 85*list = NULL; 86 }main() { 90int i; 91 ElemType item; 92 LinkList mainList; 93 LNode currentNode;mainList = initLinkList(2); 97currentNode = mainList;); 99printLinkList(&currentNode);100101currentNode = mainList;scanf(,&item);104while(item) {105insertLinkListNode(&mainList,currentNode,item);106currentNode = currentNode->next;,&item);108 }109currentNode = mainList;);112printLinkList(&currentNode);currentNode = mainList;);117for(i = 0;i < 2; i++) {118currentNode = currentNode->next;119 },currentNode->data);121deleteLinkListNode(&mainList,currentNode);122currentNode = mainList;123printLinkList(&currentNode);destroyLinkList(&mainList);127 128exit(0);129 }

，免备案空间，美国服务器，香港虚拟主机挫折其实就是迈向成功所应缴的学费。