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