您好,登錄后才能下訂單哦!
概述
單向鏈表分為單向有頭鏈表和單線無頭鏈表,本文針對單向有頭鏈表使用C語言來實(shí)現(xiàn)并進(jìn)行封裝。
實(shí)現(xiàn)
list_head.h文件
#ifndef _LIST_H_ #define _LIST_H_ typedef int datatype; #define SUCC #define MALLOC_FAIL 1 #define NOHEADNODE 2 #define INDEXFAIL 3 #define LIST_EMPTY 4 #define LIST_NOEMPTY 5 #define FAIL 10 typedef struct List_Node { datatype data; struct List_Node* pNext; }list; list*list_create(); int list_insert_at(list* pHead, int i, datatype* pData); int list_order_insert(list* pHead, datatype* pData); int list_delete_at(list* pHead, int index); int list_delete(list* pHead, datatype* pData); int list_isempty(list* pHead); void list_display(list* pHead); void list_destory(list* pHead); #endif // !_LIST_H_
list_head.c文件
/******************************************************** Copyright (C), 2016-2017, FileName: list Author: woniu201 Description:單向有頭鏈表使用 ********************************************************/ #include <stdio.h> #include "list_head.h" /************************************ @ Brief: 創(chuàng)建鏈表頭 @ Author: woniu201 @ Return: ************************************/ list* list_create() { list* pNode = (list *)malloc(sizeof(list)); memset(pNode, 0, sizeof(list)); if (pNode == NULL) { return MALLOC_FAIL; } pNode->pNext = NULL; return pNode; } /************************************ @ Brief: 按位置插入節(jié)點(diǎn) @ Author: woniu201 @ Return: ************************************/ int list_insert_at(list* pHead, int i, datatype* pData) { int j = 0; if (pHead == NULL) { return NOHEADNODE; } list* pNode = pHead; if (i<0) { return INDEXFAIL; } while (j< i && pNode !=NULL) { pNode = pNode->pNext; j++; } if (pNode == NULL) { return INDEXFAIL; } else { list* newNode = (list*)malloc(sizeof(list)); if (newNode ==NULL) { return MALLOC_FAIL; } memset(newNode, 0, sizeof(list)); newNode->data = *pData; pNode->pNext = newNode; } return SUCC; } /************************************ @ Brief: 按順序插入節(jié)點(diǎn) @ Author: woniu201 @ Return: ************************************/ int list_order_insert(list* pHead, datatype* pData) { if (pHead == NULL) { return NOHEADNODE; } list* pNewNode = (list*)malloc(sizeof(list)); if (pNewNode == NULL) { return MALLOC_FAIL; } memset(pNewNode, 0, sizeof(list)); pNewNode->data = *pData; list* pNode = pHead; if (pNode->pNext == NULL) { pNode->pNext = pNewNode; return SUCC; } while (pNode->pNext != NULL && pNode->pNext->data < *pData) { pNode = pNode->pNext; } if (pNode->pNext) { pNewNode->pNext = pNode->pNext; pNode->pNext = pNewNode; } else { pNode->pNext = pNewNode; } return SUCC; } /************************************ @ Brief: 按位置刪除節(jié)點(diǎn) @ Author: woniu201 @ Return: ************************************/ int list_delete_at(list* pHead, int index) { int j = 0; if (pHead == NULL) { return NOHEADNODE; } if (index < 0) { return INDEXFAIL; } list* pCur = pHead; list* pNode = pHead; while (pCur->pNext) { pNode = pCur; pCur = pCur->pNext; if (index == j) { break; } j++; } if (j< index) { printf("不存在該節(jié)點(diǎn)\n"); return INDEXFAIL; } else { if (pCur->pNext == NULL) { pNode->pNext = NULL; } else { pNode->pNext = pCur->pNext; } free(pCur); pCur = NULL; } return SUCC; } /************************************ @ Brief: 按值刪除節(jié)點(diǎn) @ Author: woniu201 @ Return: ************************************/ int list_delete(list* pHead, datatype* pData) { if (pHead == NULL) { return NOHEADNODE; } list* pCur = pHead; list* pNode = pHead; int bFind = 0; while (pCur->pNext) { pNode = pCur; pCur = pCur->pNext; if (pCur->data == *pData) { bFind = 1; break; } } if (!bFind) { printf("不存在該節(jié)點(diǎn)\n"); return INDEXFAIL; } else { if (pCur->pNext == NULL) { pNode->pNext = NULL; } else { pNode->pNext = pCur->pNext; } free(pCur); pCur = NULL; } return SUCC; } /************************************ @ Brief: 判斷鏈表是否為空 @ Author: woniu201 @ Return: ************************************/ int list_isempty(list* pHead) { if (pHead->pNext == NULL) { return LIST_EMPTY; } else { return LIST_NOEMPTY; } } /************************************ @ Brief: 遍歷打印鏈表 @ Author: woniu201 @ Return: ************************************/ void list_display(list* pHead) { if (list_isempty(pHead) == LIST_EMPTY) { printf("鏈表為空\n"); return FAIL; } list* pNode = pHead->pNext; while (pNode) { printf("%d\n", pNode->data); pNode = pNode->pNext; } } /************************************ @ Brief: 釋放鏈表內(nèi)存 @ Author: woniu201 @ Return: ************************************/ void list_destory(list* pHead) { list* pCur = pHead; list* pNext = pHead->pNext; while (pNext) { pNext = pNext->pNext; free(pCur); pCur = NULL; pCur = pNext; } }
main.c 測試
#include <stdio.h> #include "list_head.h" int main() { list* pHead = list_create(); int data1 = 1; int data2 = 3; int data3 = 2; // int ret = list_insert_at(pHead,0, &data1); // ret = list_insert_at(pHead, 1, &data2); // if (ret == INDEXFAIL) // { // printf("添加索引位置錯誤\n"); // } list_order_insert(pHead, &data2); list_order_insert(pHead, &data1); list_order_insert(pHead, &data3); list_delete_at(pHead, 3); int deleteData = 1; list_delete(pHead, &deleteData); list_display(pHead); list_destory(pHead); return 1; }
總結(jié)
以上就是這篇文章的全部內(nèi)容了,希望本文的內(nèi)容對大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價值,謝謝大家對億速云的支持。如果你想了解更多相關(guān)內(nèi)容請查看下面相關(guān)鏈接
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。