双向循环链表的模块化实现

思维导图

---

头文件中

List.h

#pragma once
#include<stdlib.h>
#include<assert.h>
#include<stdio.h>
#include<stdbool.h>
typedef int LTDataType;
typedef struct ListNode
{
    struct ListNode* next;
    struct ListNode* prev;
    LTDataType data;
}LTNode;

//void LTInit(LTNode** pphead);
LTNode* LTInit();
void LTDestroy(LTNode* phead);
void LTPushBack(LTNode*phead,LTDataType x);
void LTPopBack(LTNode* phead);
void LTPrint(LTNode* phead);
bool LTEmpty(LTNode* phead);
void LTPushFront(LTNode* phead, LTDataType x);
void LTPopFront(LTNode* phead);
//在pos之前插入一个值
void LTInsert(LTNode* pos, LTDataType x);
void LTErase(LTNode* pos);
LTNode*LTFind(LTNode* phead, LTDataType x);

---

源文件中

List.c

#include"List.h"
LTNode* BuyListNode(LTDataType x)
{
    LTNode* node = (LTNode * )malloc(sizeof(LTNode));
    if (node == NULL)
    {
        perror("malloc fail");
        /*return NULL;*/
        exit(-1);
    }
    node->next = NULL;
    node->prev = NULL;
    node->data = x;
    return node;
}

void LTPrint(LTNode* phead)
{
    assert(phead);
    printf("<=head=>");
    LTNode* cur = phead->next;
    while (cur != phead)
    {
        printf("%d<=>", cur->data);
        cur = cur->next;
    }
    printf("\n");
}

bool LTEmpty(LTNode* phead)
{
    assert(phead);
    /*if (phead->next = phead)
    {
        return true;
    }
    else
    {
        return false;
    }*/
    return phead->next == phead;
}


LTNode* LTInit()//要赋值所以要用二级指针，否则形参的改变不影响实参
{
    //要赋值所以要用二级指针，否则形参的改变不影响实参
    LTNode* phead = BuyListNode(-1);//或者也可以用返回值
    phead->next = phead;
    phead->prev = phead;
    return phead;
}
void LTDestroy(LTNode* phead)
{
    assert(phead);
    //phead cur next
    LTNode*cur=phead->next;
    while (cur != phead)
    {
        LTNode* next = cur->next;
        free(cur);
        cur = NULL;
        cur = next;
    }
    free(phead);
    /*phead = NULL;*/

}

void LTPushBack(LTNode* phead, LTDataType x)//不需要二级指针，改结构体指针即可
{
    assert(phead);
    LTNode* newnode = BuyListNode(x);
    LTNode* tail = phead->prev;
    //phead                  tail newnode
    tail->next = newnode;
    newnode->prev = tail;
    newnode->next = phead;
    phead->prev = newnode;
    /*LTInsert(phead, x);*/
}

void LTPopBack(LTNode* phead)
{
    assert(phead);
    assert(!LTEmpty(phead));
    /*LTNode* tail = phead->prev;
    LTNode* tailPrev = tail->prev;
    tailPrev->next = phead;
    phead->prev = tailPrev;
    free(tail);
    tail = NULL;*/
    LTErase(phead->prev);
}

void LTPushFront(LTNode* phead, LTDataType x)
{
    assert(phead);
    LTNode* newnode = BuyListNode(x);
    LTNode* first = phead->next;
    phead->next =newnode;
    newnode->prev = phead;
    newnode->next = first;
    first->prev = newnode;
    //不能随便换顺序
    /*newnode->next = phead->next;
    phead->next->prev = newnode;
    phead->next = newnode;
    newnode->prev = phead;*/

    /*LTInsert(phead->next, x);*/
    
}

void LTPopFront(LTNode* phead)
{
    assert(phead);
    assert(!LTEmpty(phead));
    //...
    LTErase(phead->next);
}

void LTInsert(LTNode* pos, LTDataType x)//pos前面插入newnode
{
    assert(pos);
    LTNode* prev = pos->prev;
    //prev newnode pos
    LTNode* newnode = BuyListNode(x);
    prev->next = newnode;
    newnode->prev = prev;
    newnode->next = pos;
    pos->prev = newnode;
}

void LTErase(LTNode* pos)
{
    assert(pos);
    //prev pos newnode 
    LTNode* prev = pos->prev;
    LTNode* newnode = pos->next;
    prev->next = newnode;
    newnode->prev = prev;
    free(pos);
    pos = NULL;
}

LTNode* LTFind(LTNode* phead, LTDataType x)
{
    assert(phead);
    LTNode* cur = phead->next;
    while (cur != phead)
    {
        if (cur->data == x)
        {
            return cur;
        }
        cur = cur->next;
    }
    return NULL;
}

Test.c

#include"List.h"
void TestList1()
{
    LTNode* plist = LTInit();
    LTPushBack(plist, 1);
    LTPushBack(plist, 2);
    LTPushBack(plist, 3);
    LTPushBack(plist, 4);
    LTPrint(plist);
    LTPopBack(plist);
    LTPopBack(plist);
    LTPrint(plist);
    LTPushFront(plist,1);
    LTPushFront(plist, 2);
    LTPushFront(plist, 3);
    LTPushFront(plist, 4);
    LTPrint(plist);
}

void TestList2()
{
    LTNode* plist = LTInit();
    LTPushBack(plist, 1);
    LTPushBack(plist, 2);
    LTPushBack(plist, 3);
    LTPushBack(plist, 4);
    LTPrint(plist);
    LTNode* pos = LTFind(plist, 3);
    if (pos)
    {
        LTErase(pos);
        pos = NULL;
    }
    LTPrint(plist);
    /*LTErase(plist);
    LTPrint(plist);*/
    LTDestroy(plist);
    plist = NULL;
}

int main()
{
    TestList2();
    return 0;
}

---

运行结果