时隔多年，再次实现的链表

代码非常简单，不多少，list.h

#ifndef list_h
#define list_h

#include <stdlib.h>
#include <stdio.h>

#define MaxSize 10

typedef int DataType;

typedef struct _node{
    /*int id;
    bool sex;
    char name[MaxSize];*/
    DataType data;

    struct _node *next;
} Node;

typedef struct _list{
    Node *head;
    Node *tail;
    Node *current;
} List;

void initList(List *);
void addHead(List *, DataType);
void addTail(List *, DataType);
void delElem(List *, DataType);
void modiElem(List *, DataType, DataType);
int locaElem(List *, DataType);
int lenthList(List *);
void travList(List *);

#endif

实现list.c

#include "list.h"

void initList(List *list){
    printf("begin initList():
");
    list->head = NULL;
    list->tail = NULL;
    list->current = NULL;

    return;
}

void addHead(List *list, DataType data){
    printf("begin addHead():
");
    //申请新节点的空间
    Node *node = (Node *)malloc(sizeof(Node));
    //修正新节点的数据域
    node->data = data;
    //更该新节点的指针域
    node->next = NULL;

    if(list->head == NULL){
        list->tail = node;
    }else{
        node->next = list->head;
    }
    list->head = node;

    return;
}

void addTail(List *list, DataType data){
    printf("begin addTail():
");
    //申请新节点的空间
    Node *node = (Node *)malloc(sizeof(Node));
    //修正新节点的数据域
    node->data = data;
    //更该新节点的指针域
    node->next = NULL;

    if(list->head == NULL){
        list->head = node;
    }else{
        list->tail->next = node;
    }
    list->tail = node;

    return;
}

void delElem(List *list, DataType data){
    printf("begin delElem():
");
    Node *tmp = list->head;
    if(list->head->data == data){
        list->head = list->head->next;
    }
    while(tmp && tmp->next){
        if(tmp->next->data == data){
            tmp->next = tmp->next->next;
        }
        tmp = tmp->next;
    }

    return;
}

void modiElem(List *list, DataType dataB, DataType dataA){
    printf("begin modiElem():
");
    Node *tmp = list->head;
    while(tmp->next){
        if(tmp->data = dataB){
            tmp->data = dataA;
        }
        tmp = tmp->next;
    }

    return;
}

int locaElem(List *list, DataType data){
    printf("begin locaElem():
");
    Node *tmp = list->head;
    int i = -1;
    while(tmp){
        if(tmp->data != data){
            i++;
        }
        tmp = tmp->next;
    }

    return i;
}

int lenthList(List *list){
    printf("begin lenthList():
");
    Node *tmp = list->head;
    int i = 0;
    while(tmp){
        i++;
        tmp = tmp->next;
    }

    return i;
}

void travList(List *list){
    printf("begin travList():
");
    Node *tmp = list->head;
    int i = 1;
    while(tmp){
        printf("The %dth: %d	", i, tmp->data);
        tmp = tmp->next;
        i++;
    }
    printf("
");

    return;
}

测试文件testList.c

#include "list.h"
#define Size 5

int main(int argc, char **argv)
{
    List *list = (List *)malloc(sizeof(List));
    initList(list);
    for(int i = 0; i < Size; i++){
        addHead(list, i*5);
    }
    travList(list);
    printf("the list size: %d
",  lenthList(list));
    delElem(list, 5);
    travList(list);
    printf("the list size: %d
",  lenthList(list));

    List *list2 = (List *)malloc(sizeof(List));
    initList(list2);
    for(int i = 0; i < Size; i++){
        addTail(list2, i*3);
    }
    travList(list2);
    printf("the list2 size: %d
",  lenthList(list2));
    printf("the %d is local: %d
", 6, locaElem(list2, 6));
    delElem(list2, 6);
    travList(list2);
    printf("the list2 size: %d
",  lenthList(list2));

    return 0;
}

Makefile文件：

testList:testList.c list.c
    gcc -g $^ -o $@
clean:
    rm *.o testList
.PHONY: clean

编译：

make

测试

./testList

测试结果：

gcc -g testList.c list.c -o testList

begin initList():
begin addHead():
begin addHead():
begin addHead():
begin addHead():
begin addHead():
begin travList():
The 1th: 20     The 2th: 15     The 3th: 10     The 4th: 5      The 5th: 0
begin lenthList():
the list size: 5
begin delElem():
begin travList():
The 1th: 20     The 2th: 15     The 3th: 10     The 4th: 0
begin lenthList():
the list size: 4

begin initList():
begin addTail():
begin addTail():
begin addTail():
begin addTail():
begin addTail():
begin travList():
The 1th: 0      The 2th: 3      The 3th: 6      The 4th: 9      The 5th: 12
begin lenthList():
the list2 size: 5
begin locaElem():
the 6 is local: 3
begin delElem():
begin travList():
The 1th: 0      The 2th: 3      The 3th: 9      The 4th: 12
begin lenthList():
the list2 size: 4