链表的C/C++语言实现方式

list文件：

// list.h

#ifndef  __MY_H_
#define  __MY_H_

typedef char EleType;   //定义链表存储的数据类型 

//链表节点结构
typedef struct node
{
    EleType data;
    struct node * next;
}ChainNode;

//头结点
typedef struct {
    ChainNode* head;
} List;


List* CreateList();     //创建链表
void DestoryLIst(List* );       //删除链表
void ClearList(List* );
int ListAppend(List*, EleType);     //追加元素
int ListInsert(List*, int, EleType);    //插入元素
int ListDelete(List*, int);     //删除元素
int GetElememt(List*, int, EleType *);  //取元素
ChainNode* GetAddr(List*,int );     //取元素地址
ChainNode* NewChainNode(EleType);   //创建一个元素节点
int TraverseList(List*, int(*) (EleType*) );    //遍历元素
void ShowList(List*);
int PrintElement(EleType *);
#endif

文件list.cpp

// list.cpp

#include "list.h"
#include <iostream>
using namespace std;

//创建链表,仅有头结点
List* CreateList()
{
    List* p = new List;
    EleType data = (EleType)0;
    p->head = NewChainNode(data);
    if(NULL != p && NULL !=p->head) 
    {
        p->head->data = data;
        p->head->next = NULL;
        return p;
    }
    cout<<"分配内存失败"<<endl;
    return NULL;
}
    

//删除链表
void DestoryLIst(List* lp)
{
    if(NULL != lp)
    {
        ClearList(lp);
        delete lp;
    }
}   

//清空链表
void ClearList(List* lp)
{
    if(NULL != lp)
    {
        while(ListDelete(lp, 1) );
    }
    
}

//追加元素
int ListAppend(List* lp, EleType ele)
{
    ChainNode* p=NULL;
    ChainNode* newp= NewChainNode(ele);
    if(NULL != lp && NULL != newp)
    {
        for(p=lp->head; p->next; p=p->next);
        p->next = newp; 
        return 1;
    }
    return 0;
}   

//插入元素
int ListInsert(List* lp, int n, EleType ele)
{
    ChainNode* p=NULL;
    ChainNode* newp= NewChainNode(ele);

    if(NULL != lp && NULL != newp)
    {
        p = GetAddr(lp, n-1);
        newp->next = p->next;
        p->next = newp;
        return 1;
    }
    return 0;
}   

//删除元素
int ListDelete(List* lp, int n)
{
    ChainNode* temp = NULL;
    if(NULL != lp && NULL != lp->head->next)
    {
        temp = GetAddr(lp, n-1);
        if(NULL != temp && NULL != temp->next)
        {
            temp->next = temp->next->next;
            return 1;
        }
    }
    return 0;
}

//取元素
int GetElememt(List* lp, int n, EleType * ele)
{
    ChainNode* p = NULL;
    if(NULL != lp && NULL != lp->head->next)
    {
        p =GetAddr(lp, n-1);
        if(NULL != p)
        {
            *ele = p->data;
            return 1;
        }
    }
    return 0;
}

//取元素地址
ChainNode* GetAddr(List* lp,int n )
{
    if(n >= 0)
    {
        ChainNode* p = lp->head;
        if(NULL != lp && NULL != p->next)
        {
            int i = 0;
            while(NULL !=p && i<n)
            {
                p = p->next;
                i++;
            }
            return p;
        }
    }
    cout<<"n应该为非负数"<<endl;
    return NULL;
}

//创建一个元素节点
ChainNode* NewChainNode(EleType ele)
{
    ChainNode* p =new ChainNode;
    if(p != NULL)
    {
        p->data = ele;
        p->next = NULL;
        
    }
    return p;
}

//遍历元素
int TraverseList(List* lp, int (*f) (EleType *) )   
{   
    if(NULL != lp)
    {
        ChainNode* p = lp->head->next;
        int i =0;
        for( ; NULL != p; p= p->next)
        {
            if( !f(&(p->data)) )
            {
                return i+1;
            }
            i++;
        }
        return 0;

    }

}

void ShowList(List* lp)
{
    TraverseList(lp, PrintElement);
    cout<<endl;
}

int PrintElement(EleType *data)
{
    cout<<" "<<*data;
    return 1;
}

文件main.cpp

// main.cpp

#include "list.h"
#include <iostream>
using namespace std;

int main()
{
    char arr[20] ="hello world";

    List* lp = CreateList();
    if(NULL ==lp ) return 0;
    for(int i = 0; arr[i]; i++)
    {
        ListAppend(lp,arr[i]);
    }
    ShowList(lp);

    ListAppend(lp,'o');
    ListAppend(lp,'v');
    ListAppend(lp,'r');
    ListAppend(lp,'y');
    ShowList(lp);

    ListInsert(lp,1,'a');
    ListInsert(lp,2,'b');
    ShowList(lp);

    ListDelete(lp,1);
    ShowList(lp);
    ListDelete(lp,1);
    ShowList(lp);

    return 0;
}