数据结构之__链表

首先，定义数诀结构listg.h

#ifndef listg_h
#define listg_h
#include <stdlib.h>
#include <stdio.h>

typedef int DataType;

typedef struct node_{
    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 delNode(List *, DataType);
Node *getNode(List *, DataType);
int getLength(List *);
void dispList(List *);

#endif

接着，实现头文件定义的函数listg.c

#include "listg.h"

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

    return;
}

void addHead(List *list, DataType data){
    //1、创建一个节点
    Node *node = (Node *)malloc(sizeof(Node));
    node->data = data;
    node->next = NULL;

    //2、插入节点准备
    if(list->head == NULL){
        list->tail = node;
    }else{
        node->next = list->head;
    //3、插入节点
    }
    list->head = node;

    return;
}

void addTail(List *list, DataType data){
    //1
    Node *node = (Node *)malloc(sizeof(Node));
    node->data = data;
    node->next = NULL;

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

    //3
    list->tail = node;

    return;
}

void delNode(List *list, DataType data){
    Node *prev = list->head;
    Node *node = prev->next;

    while(node != NULL){
        if(node->data == data){
            prev->next = prev->next->next;
        }else{
            prev->next = node;
        }
    }
}

Node *getNode(List *list, DataType data){
    Node *node = (Node *)malloc(sizeof(Node));
    node = list->head;

    while(node != NULL){
        if(data ==node->data){
            return node;
        }else{
            node = node->next;
        }
    }

    return NULL;
}

int getLength(List *list){
    Node *node = (Node*)malloc(sizeof(Node));
    node = list->head;
    int i = 0;
    while(node != NULL){
        node = node->next;
        i++;
    }

    return i;
}

void dispList(List *list){
    Node *node = (Node *)malloc(sizeof(Node));
    node = list->head;
    int i = 0;
    while(node != NULL){
        printf("the %dth node: %d
", i + 1, node->data);
        node = node->next;
        i++;
    }
    printf("display finished
");

    return;
}

最后，测试文件testListg.c

#include "listg.h"

int main(int argc, char **argv)
{
    List *list = (List *)malloc(sizeof(List));
    initList(list);
    addHead(list, 4);
    addHead(list, 6);
    addHead(list, 8);
    addHead(list, 10);
    dispList(list);
    printf("the list: %d
", getLength(list));

    return 0;
}

测试结果没有什么问题