链表的实现以及相关函数

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
//
typedef struct Node
{
    int data;
    struct Node *next;
} Node, *PNode;

typedef struct
{
    struct Node *header;
    size_t length;
} LinkList, *PLinkList;

// 初始化
void linkList_init(LinkList *list)
{
    list->header = NULL;
    list->length = 0;
}
// 获取链表长度
size_t get_length(LinkList *list)
{
    return list->length;
}
// 释放链表空间
void linkList_destroy(LinkList *list)
{
    if (list->header == NULL)
    {
        return;
    }
    Node *current_node = list->header;
    while (current_node != NULL)
    {
        Node *temp_node = current_node;
        current_node = current_node->next;
        free(temp_node);
    }

    linkList_init(list);
}
Node *get_prev_node(LinkList *list, size_t index)
{
    Node *prev_node = list->header;
    for (size_t i = 1; i < index; i++)
    {
        prev_node = prev_node->next;
    }
    return prev_node;
}

// 向指定位置插入一个节点
void insert_at(LinkList *list, size_t index, int element)
{
    if (index > list->length)
    {
        return;
    }
    Node *new_node = (Node *)malloc(sizeof(Node));
    new_node->data = element;
    if (index == 0)
    {
        new_node->next = list->header;
        list->header = new_node;
    }
    else
    {
        Node *prev_node = get_prev_node(list, index);
        new_node->next = prev_node->next;
        prev_node->next = new_node;
    }
    list->length++;
}
// 向末尾位置插入一个节点
void insert_end(LinkList *list, int element)
{
    insert_at(list, list->length, element);
}
// 向指定位置删除一个节点
bool delete_at(LinkList *list, size_t index, int *del_element)
{
    if (index >= list->length)
    {
        return false;
    }
    Node *del_node = NULL;
    if (index == 0)
    {
        del_node = list->header;
        list->header = list->header->next;
    }
    else
    {
        Node *prev_node = get_prev_node(list, index);
        del_node->next = prev_node->next;
        prev_node->next = del_node->next;
    }
    *del_element = del_node->data;
    free(del_node);
    list->length--;
    return true;
}
// 向末尾位置删除一个节点
bool delete_end(LinkList *list, int *del_element)
{
    return delete_at(list, list->length, del_element);
}
// 向指定位置获取一个节点数据
void get_value(LinkList *list, size_t index, int *element)
{

    if (index >= list->length)
    {
        return;
    }
    if (index != 0)
    {
        Node *prev_node = get_prev_node(list, index);
        *element = prev_node->next->data;
        return;
    }
    *element = list->header->data;
}

// 向指定位置修改一个节点数据
void edit_value(LinkList *list, size_t index, int element)
{
    if (index >= list->length)
    {
        return;
    }

    if (index != 0)
    {
        Node *prev_node = get_prev_node(list, index);
        prev_node->next->data = element;
        return;
    }

    list->header->data = element;
}

// 遍历
void printf_list(LinkList *list)
{
    if (list->length == 0)
    {
        return;
    }
    Node *current_node = list->header;
    while (current_node != NULL)
    {
        printf("%d ", current_node->data);
        current_node = current_node->next;
    }
    printf("\n");
}

int main()
{
    LinkList list;
    linkList_init(&list);
    for (int i = 10; i < 20; i++)
    {
        insert_at(&list, 0, i);
    }

    printf_list(&list);
    int delect_element;
    delete_at(&list, 0, &delect_element);
    printf("删除的数据%d\n", delect_element);
    return 0;
}