二 线性表链式存储之企业链表

线性表链式存储之企业链表

一丶企业链表介绍

　　不受业务结构而限制，在我们用的数据类型发生改变时并不需要去改变底层的链表结构.

二丶企业链表实现

enterpriselist.h

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

//小结点
typedef struct LinkNode
{
    LinkNode* next;
}LinkNode;

//链表结构体
typedef struct LinkList
{
    LinkNode head;
    int size;
}LinkList;

//遍历函数指针
typedef void(*PRINTNODE)(LinkNode* data);

//比较函数指针
typedef int(*COMPARENODE)(LinkNode*, LinkNode*);

//链表初始化
LinkList* init_LinkList();

//根据位置插入数据
void insert_LinkList(LinkList* list, int pos, LinkNode* data);

//删除
void remove_LinkList(LinkList* list, int pos);

//查找
int find_LinkList(LinkList* list, LinkNode *data, COMPARENODE compare);

//返回链表大小
int size_LinkList(LinkList* list);

//遍历
void print_LinkList(LinkList* list, PRINTNODE myprint);

//释放链表内存
void free_LinkList(LinkList* list);

enterpriselist.c

#include "enterpriselist.h"

//链表初始化
LinkList* init_LinkList()
{
    LinkList* list = (LinkList*)malloc(sizeof(LinkList*));
    list->head.next = NULL;
    list->size = 0;
    return list;
}

//根据位置插入数据
void insert_LinkList(LinkList* list, int pos, LinkNode* data)
{
    if (list == NULL)
        return;
    if (data == NULL)
        return;
    if (pos <0 || pos>list->size)
        pos = list->size;
    //查找插入位置
    LinkNode* pCurrent = &(list->head);
    for (int i = 0; i < pos; i++)
    {
        pCurrent = pCurrent->next;
    }
    //插入新节点
    data->next = pCurrent->next;
    pCurrent->next = data;

    list->size++;
}


//删除
void remove_LinkList(LinkList* list, int pos)
{
    if (list == NULL)
        return;
    if (pos < 0 || pos >= list->size)
        return;
    LinkNode* pCurrent = &(list->head);
    for (int i = 0; i < pos; i++)
    {
        pCurrent = pCurrent->next;
    }
    pCurrent->next = pCurrent->next->next;
    list->size--;
}

//查找
int find_LinkList(LinkList* list, LinkNode *data, COMPARENODE compare)
{
    if (list == NULL)
        return -1;
    if (data == NULL)
        return -1;
    LinkNode* pCurrent = list->head.next;
    int index = 0;
    int flag = -1;
    while (pCurrent != NULL)
    {
        if (compare(pCurrent, data) == 0)
        {
            flag = index;
            break;
        }
        pCurrent = pCurrent->next;
        index++;
    }
    return flag;
}

//返回链表大小
int size_LinkList(LinkList* list)
{
    return list->size;
}

//遍历
void print_LinkList(LinkList* list, PRINTNODE print)
{
    if (list == NULL)
        return;
    LinkNode* pCurrent = list->head.next;
    while (pCurrent)
    {
        print(pCurrent);
        pCurrent = pCurrent->next;
    }
}

//释放链表内存
void free_LinkList(LinkList* list)
{
    if (list != NULL)
        return;
    free(list);
}

main.c

#define _CRT_SECURE_NO_WARNINGS
#include "enterpriselist.h"
#include <string>
typedef struct Person
{
    LinkNode node;//只能是第一行,相当于是挂钩
    char name[64];
    int age;
}Person;

void MyPrint(LinkNode* data)
{
    Person *p = (Person*)data;
    printf("姓名:%s,年龄:%d\n", p->name, p->age);
}

int MyCompare(LinkNode* node1, LinkNode* node2)
{
    Person* p1 = (Person*)node1;
    Person* p2 = (Person*)node2;
    if (strcmp(p1->name, p2->name) == 0 && p1->age == p2->age)
    {
        return 0;
    }
    return -1;
}

int main()
{
    LinkList* list = init_LinkList();
    Person p1, p2, p3, p4, p5;
    strcpy(p1.name, "张三");
    strcpy(p2.name, "李四");
    strcpy(p3.name, "王五");
    strcpy(p4.name, "陈六");
    strcpy(p5.name, "刘贝");

    p1.age = 20;
    p2.age = 22;
    p3.age = 19;
    p4.age = 25;
    p5.age = 27;
    insert_LinkList(list, 0, (LinkNode*)&p1);
    insert_LinkList(list, 0, (LinkNode*)&p2);
    insert_LinkList(list, 0, (LinkNode*)&p3);
    insert_LinkList(list, 0, (LinkNode*)&p4);
    insert_LinkList(list, 0, (LinkNode*)&p5);

    print_LinkList(list, MyPrint);
    //remove_LinkList(list, 1);
    printf("------------\n");
    Person findP;
    strcpy(findP.name, "陈六");
    findP.age = 35;
    int pos = find_LinkList(list, (LinkNode*)&findP, MyCompare);
    printf("位置:%d\n", pos);
    system("pause");
    return 0;
}