数据结构-链式表

LinkList.h

#ifndef __MYLINKLIST_H_
#define __MYLINKLIST_H_
typedef void LinkList;

typedef struct _tag_LinkListNode
{
    struct _tag_LinkListNode* next;
}LinkListNode;


/*链式表的创建*/
LinkList* LinkList_Create();
/*链式表的销毁*/
void LinkList_Destory(LinkList* list);
/*链式表的清空*/
void LinkList_Cleat(LinkList* list);
/*求长度*/
int LinkList_Length(LinkList* list);
/*节点插入*/
int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);
/*节点获取*/
LinkListNode* LinkList_Get(LinkList* list, int pos);
/*节点删除*/
LinkListNode* LinkList_Delete(LinkList* list, int pos);



#endif

LinkList.c

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "LinkList.h"


typedef struct _tag_LinkList
{
    LinkListNode header;
    int length;
}TLinklist;

LinkList* LinkList_Create()
{
    TLinklist *ret = NULL;
    ret = (TLinklist*)malloc(sizeof(TLinklist));
    memset(ret, 0, sizeof(TLinklist));
    return ret;
}

void LinkList_Destory(LinkList* list)
{
    if (list != NULL)
    {
        free(list);
        list = NULL;
    }
    return;
}
void LinkList_Clear(LinkList* list)
{
    TLinklist *tlist = NULL;
    if (list == NULL)
    {
        return;
    }
    tlist = (TLinklist*)list;
    tlist->length = 0;
    tlist->header.next = NULL;
    return;
}

int LinkList_Length(LinkList* list)
{
    TLinklist *tlist = NULL;
    if (list == NULL)
    {
        return -1;
    }
    tlist = (TLinklist*)list;
    return tlist->length;
}

int LinkList_Insert(LinkList* list, LinkListNode* node, int pos)
{
    if (list == NULL || node == NULL || pos < 0)
    {
        return -1;
    }
    TLinklist *tlist = (TLinklist*)list;
    LinkListNode *pCur = (LinkListNode*)tlist;
    while (pCur&&pos--)
    {
        pCur = pCur->next;
    }
    if (pCur == NULL)
    {
        return -2;
    }
    node->next = pCur->next;
    pCur->next = node;
    tlist->length++;
    return 0;
}

LinkListNode* LinkList_Get(LinkList* list, int pos)
{
    if (list == NULL ||  pos < 0)
    {
        return NULL;
    }
    TLinklist *tlist = (TLinklist*)list;
    LinkListNode *pCur = (LinkListNode*)tlist;
    pos++;
    while (pCur&&pos--)
    {
        pCur = pCur->next;
    }
    pCur = pCur->next;
    if (pCur==NULL)
    {
        return NULL;
    }
    return pCur;
}

LinkListNode* LinkList_Delete(LinkList* list, int pos)
{
    if (list == NULL || pos < 0)
    {
        return NULL;
    }
    TLinklist *tlist = (TLinklist*)list;
    LinkListNode *pCur = (LinkListNode*)tlist;
    while (pCur&&pos--)
    {
        pCur = pCur->next;
    }
    if (pCur == NULL)
    {
        return NULL;
    }
    LinkListNode *preDel = pCur;
    if (preDel == NULL)
    {
        return NULL;
    }
    else
    {
        pCur->next = preDel->next;
        tlist->length--;
        return preDel;
    }
}

main.c

#include <stdio.h>
#include "LinkList.h"

typedef struct Teacher
{
    LinkListNode node;
    int age;
    char name[64];
}Teacher;

int main()
{
    int len = 0, ret = 0, i = 0;

    LinkList* list = NULL;
    Teacher t1, t2, t3, t4, t5;
    t1.age = 31;
    t2.age = 32;
    t3.age = 33;
    t4.age = 34;
    t5.age = 35;
    list = LinkList_Create();
    if (list == NULL)
    {
        return -1;
    }



    ret = LinkList_Insert(list, (LinkListNode*)(&t1), 0);
    ret = LinkList_Insert(list, (LinkListNode*)(&t2), 0);
    ret = LinkList_Insert(list, (LinkListNode*)(&t3), 0);
    ret = LinkList_Insert(list, (LinkListNode*)(&t4), 0);
    ret = LinkList_Insert(list, (LinkListNode*)(&t5), 0);
    len = LinkList_Length(list);
    for (i = 0; i < len; i++)
    {
        Teacher *tmp = (Teacher*)LinkList_Get(list, i);
        printf("tmp->age=%d\n", tmp->age);
    }
    return 0;
}