#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
typedef int DataType_t;
typedef struct DoubleCircularLinkedList
{
DataType_t data;
struct DoubleCircularLinkedList *prev;
struct DoubleCircularLinkedList *next;
} DoubleCirLList_t;
DoubleCirLList_t *DoubleCirLList_Create(void)
{
DoubleCirLList_t *Head = (DoubleCirLList_t *)calloc(1, sizeof(DoubleCirLList_t));
if (NULL == Head)
{
perror("Calloc memory for Head is Failed");
exit(-1);
}
Head->prev = Head;
Head->next = Head;
return Head;
}
DoubleCirLList_t *DoubleCirLList_NewNode(DataType_t data)
{
DoubleCirLList_t *New = (DoubleCirLList_t *)calloc(1, sizeof(DoubleCirLList_t));
if (NULL == New)
{
perror("Calloc memory for NewNode is Failed");
return NULL;
}
New->data = data;
New->prev = New;
New->next = New;
return New;
}
bool DoubleCirLList_HeadInsert(DoubleCirLList_t *Head, DataType_t data)
{
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
Head->next->prev->next = New;
New->prev = Head->next->prev;
New->next = Head->next;
Head->next->prev = New;
Head->next = New;
return true;
}
bool DoubleCirLList_TailInsert(DoubleCirLList_t *Head, DataType_t data)
{
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
New->prev = Head->next->prev;
Head->next->prev->next = New;
New->next = Head->next;
Head->next->prev = New;
return true;
}
bool DoubleCirLList_DestInsert(DoubleCirLList_t *Head, DataType_t destval, DataType_t data)
{
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
DoubleCirLList_t *Dest = Head->next;
while (Dest->data != destval && Dest != NULL)
{
Dest = Dest->next;
}
if (NULL == Dest)
{
return false;
}
New->next = Dest->next;
Dest->next->prev = New;
New->prev = Dest;
Dest->next = New;
return true;
}
bool DoubleCirLList_HeadDel(DoubleCirLList_t *Head)
{
if (NULL == Head->next)
{
return false;
}
DoubleCirLList_t *Temp = Head->next;
Temp->prev->next = Temp->next;
Temp->next->prev = Temp->prev;
Head->next = Temp->next;
Temp->next = NULL;
Temp->prev = NULL;
free(Temp);
return true;
}
bool DoubleCirLList_TailDel(DoubleCirLList_t *Head)
{
if (NULL == Head->next)
{
return false;
}
DoubleCirLList_t *Tail = Head->next->prev;
Tail->prev->next = Head->next;
Head->next->prev = Tail->prev;
Tail->next = NULL;
Tail->prev = NULL;
free(Tail);
return true;
}
bool DoubleCirLList_DestDel(DoubleCirLList_t *Head, DataType_t destval)
{
if (NULL == Head->next)
{
return false;
}
DoubleCirLList_t *Dest = Head;
while (Dest->data != destval && Dest != NULL)
{
Dest = Dest->next;
}
if (NULL == Dest)
{
return false;
}
Dest->prev->next = Dest->next;
Dest->next->prev = Dest->prev;
Dest->prev = NULL;
Dest->next = NULL;
free(Dest);
}
bool DoubleLList_Print(DoubleCirLList_t *Head)
{
DoubleCirLList_t *Phead = Head;
if (Head->next == Head)
{
printf("current doubleCircularLinkedList is empty!\n");
return false;
}
while (Phead->next)
{
Phead = Phead->next;
printf("data = %d\n", Phead->data);
if (Phead->next == Head->next)
{
break;
}
}
return true;
}
int main(int argc, char const *argv[])
{
DoubleCirLList_t *Head = DoubleCirLList_Create();
DoubleCirLList_HeadInsert(Head, 1);
DoubleCirLList_HeadInsert(Head, 2);
DoubleCirLList_HeadInsert(Head, 3);
DoubleCirLList_HeadDel(Head);
DoubleLList_Print(Head);
return 0;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步