C/C++实现单向链表

#include <stdio.h> #include <stdlib.h> #include <string.h> #include "CSignleLinkList.h" typedef struct _strTLinkList { CNode header; int lenght; }TLinkList; CLinkList * CreateLinkList() { TLinkList *list = (TLinkList*)malloc(sizeof(TLinkList)); memset(list, 0, sizeof(TLinkList)); list->header.next = NULL; list->lenght = 0; return (CLinkList*)list; } int InsertLinkListNode( const CLinkList *list, CNode *node, int pos ) { int index = 0; CNode *current = NULL; CNode *temp = NULL; TLinkList *tlist = (TLinkList*)list; if (!list) { return -1; } current = &((TLinkList *)list)->header; pos = pos < 0 ? 0 : pos; pos = pos > tlist->lenght ? tlist->lenght : pos; for (index = 0; index < pos; index++) { current = current->next; } temp = (CNode*)malloc(sizeof(CNode)); memset(temp, 0, sizeof(CNode)); temp = node; temp->next = current->next; current->next = temp; tlist->lenght++; return pos; } const CNode * GetLinkListNode( const CLinkList *list, int pos ) { int index = 0; CNode *current = NULL; TLinkList *tlist = NULL; if (!list) { return current; } current = &((TLinkList *)list)->header; tlist = (TLinkList*)list; if (pos < 0 || pos > tlist->lenght) { return current; } for (index = 0; index < pos; index++) { current = current->next; } return current->next; } int DeleteLinkListNode( const CLinkList *list, int pos, CNode **node ) { int index = 0; CNode *current = NULL; CNode *temp = NULL; TLinkList *tlist = NULL; if (!list) { return -1; } current = &((TLinkList *)list)->header; tlist = (TLinkList*)list; if (pos < 0 || pos > tlist->lenght) { return -1; } for (index = 0; index < pos; index++) { current = current->next; } temp = current->next; current->next = temp->next; tlist->lenght--; temp->next = NULL; if (node) { *node = temp; } // free(temp); // temp = NULL; return index; } int GetLinkListLenght( const CLinkList *list ) { TLinkList *tlist = NULL; if (!list) { return 0; } tlist = (TLinkList*)list; return tlist->lenght; } int ClearLinkList( const CLinkList *list ) { TLinkList *tlist = NULL; CNode *first = NULL; CNode *temp = NULL; if (!list) { return -1; } tlist = (TLinkList*)list; first = tlist->header.next; while (first != NULL) { temp = first->next; first->next = NULL; // free(first); // first = NULL; first = temp; } tlist->lenght = 0; return tlist->lenght; } void DestoryLinkList( CLinkList *list ) { TLinkList *tlist = NULL; if (!list) { return; } ClearLinkList(list); tlist = (TLinkList*)list; free(tlist); }