C語言實現單鏈表實現方法
鏈表和我們之前實現過的順序表一樣，都是簡單的數據結構，鏈表分為單向鏈表、雙向鏈表、循環鏈表。而單向鏈表又分為兩種實現方法，一種為帶頭節點的單鏈表，一種為不帶頭節點的單鏈表。我們來具體看看不帶頭節點的單鏈表的實現
單鏈表：它是一種鏈式存儲的線性表，用一組地址任意的存儲單元存放線性表的數據元素，稱存儲單元為一個節點。
今天我們來實現一些單鏈表的簡單接口
先看看單鏈表的結構： （為了通用性，我們將類型重命名為DataType）
typedef int DataType;//鏈表typedef struct Node{ DataType *data; struct Node *next;}Node, *pNode, *pList;接下來看看我們要實現的接口：
void InitLinkList(pList *pplist);//初始化鏈表pNode BuyNode(DataType d);//創建鏈表節點void PushBack(pList *pplist, DataType d);//尾插void PopBack(pList *pplist);//尾刪void PushFront(pList *pplist, DataType d);//頭插void PopFront(pList *pplist);//頭刪void PrintList(pList plist);//打印鏈表pNode Find(pList plist, DataType d);//查找指定元素void Remove(pList *pplist, DataType d);//刪除指定的一個元素void RemoveAll(pList *pplist, DataType d);//刪除指定的所有元素void Insert(pList *pplist, pNode pos, DataType d);//指定位置的后面插入void Erase(pList *pplist, pNode pos);//指定位置刪除void DestroyList(pList *pplist);//銷毀鏈表
來看看每個接口的具體實現：
pNode BuyNode(DataType d){ pNode newNode = (pNode)malloc(sizeof(Node)); if (newNode == NULL) { perror("malloc"); exit(EXIT_FAILURE); } newNode->data = d; newNode->next = NULL; return newNode;}void InitLinkList(pList *pplist){ assert(pplist); *pplist = NULL;}void PushBack(pList *pplist, DataType d){ assert(pplist); pNode newNode = BuyNode(d); pNode cur = *pplist; //鏈表沒有節點 if (*pplist == NULL) { *pplist = newNode; return; } //鏈表有節點 while (cur->next != NULL) { cur = cur->next; } cur->next = newNode;}void PopBack(pList *pplist){ pNode cur = *pplist; pNode prev = NULL; assert(pplist); //鏈表沒有節點 if (*pplist == NULL) { return; } //鏈表有一個節點 if (cur->next == NULL) { free(*pplist); *pplist = NULL; return; } //鏈表有兩個及兩個以上節點 while (cur->next != NULL) { prev = cur;//prev中保存的是cur之前的那個節點 cur = cur->next; } prev->next = NULL; free(cur);}void PushFront(pList *pplist, DataType d){ pNode newNode = BuyNode(d); //pNode cur = *pplist; assert(pplist); ////鏈表沒有節點 //if (*pplist == NULL) //{ // *pplist = newNode; //} ////鏈表有節點 newNode->next = *pplist; *pplist = newNode;}void PopFront(pList *pplist){ pNode cur = *pplist; assert(pplist); //鏈表為空 if (*pplist == NULL) { return; } *pplist = cur->next; free(cur); cur = NULL;}void PrintList(pList plist){ pNode cur = plist; while (cur) { printf("%d-->", cur->data); cur = cur->next; } printf("NULL/n");}pNode Find(pList plist, DataType d){ pNode cur = plist; while (cur) { if (cur->data == d) { return cur; } cur = cur->next; } return NULL;}void Remove(pList *pplist, DataType d){ pNode cur = *pplist; pNode prev = NULL; assert(pplist); if (cur == NULL) { return; } while (cur) { if (cur->data == d) { pNode del = cur; if (cur == *pplist) { *pplist = cur->next; } prev->next = cur->next; free(del); del = NULL; return; } else { prev = cur; cur = cur->next; } }}void RemoveAll(pList *pplist, DataType d){ pNode cur = *pplist; pNode prev = NULL; assert(pplist); if (*pplist == NULL) { return; } while (cur) { if (cur->data == d) { pNode del = cur; if (cur == *pplist) { *pplist = cur->next; } else { prev->next = cur->next; } cur = cur->next; free(del); del = NULL; } else { prev = cur; cur = cur->next; } }}//在pos后面插入一個元素void Insert(pList *pplist, pNode pos, DataType d){ pNode newNode = BuyNode(d); assert(pplist); assert(pos); if (*pplist == NULL) { PushFront(pplist, d); return; } newNode->next = pos->next; pos->next = newNode;}void Erase(pList *pplist, pNode pos){ assert(pplist); assert(pos); //要刪除的是尾節點 if (pos->next == NULL) { PopBack(pplist); } //刪除的是非尾節點 else { pNode del = pos->next; pos->data = pos->next->data; pos->next = pos->next->next; free(del); del = NULL; }}void DestroyList(pList *pplist){ assert(pplist); pNode cur = *pplist; while (cur) { pNode del = cur; cur = cur->next; printf("del:%d/n", del->data); free(del); del = NULL; }}由于這些接口都較為簡單，所以不進行具體的測試展示，讀者可以自行測試
以上就是C語言實現單鏈表實現方法，如有疑問請留言或者到本站社區交流討論，感謝閱讀，希望能幫助到大家，謝謝大家對本站的支持！
新聞熱點
疑難解答
圖片精選
