链表的分类
带头或不带头 这里的头可以说是带不带哨兵位
单项或双向
循环或不循环
但是在实际中我们最常见的是这两个结构
2.带头双向循环链表的实现
还是离不开增删查改,这样的结构更方便,比单向的链表更容易实现,往期单向链表的实现链接:
https://blog.csdn.net/m0_65014490/article/details/129248872?spm=1001.2014.3001.5502
2.1结构的定义
typedef int LTDataType;
typedef struct ListNode
{
struct ListNode* prev;
struct ListNode* next;
LTDataType data;
}LTNode;
2.2初始化链表
LTNode* LTInit()
{
LTNode* phead = BuyListNode(-1);
phead->next = phead;
phead->prev = phead;
return phead;
}
因为我们这个链表是带哨兵位的所以我们需要初始化一个phead前后都指向自己。
2.3创建一个新节点
LTNode * BuyLTNode(LTDataType x) //创建新的节点
{
LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
if (newnode == NULL)
{
perror("malloc fail");
return NULL;
}
newnode->prev = NULL;
newnode->next = NULL;
newnode->data = x;
return newnode;
}
需要将prev和next的指向都置空。
2.4在链表的尾部插入数据(尾插)
void LTPushBack(LTNode* phead,LTDataType x) //尾插
{
assert(phead);
/*LTNode* newnode = BuyLTNode(x);
LTNode* tail = phead->prev;
phead->prev = newnode;
tail->next = newnode;
newnode->prev = tail;
newnode->next = phead;*/
LTInsert(phead, x);
}
这里我们注意尾插的实现可以在哨兵位的前面插入是一样的效果。
2.5在链表的头部插入数据(头插)
void LTPushFront(LTNode* phead,LTDataType x)//头插
{
assert(phead);
/*LTNode* newnode = BuyLTNode(x);
LTNode* first = phead->next;
phead->next = newnode;
newnode->prev = phead;
newnode->next = first;
first->prev = newnode;*/
LTInsert(phead->next, x);
}
2.6删除链表的头部
bool LTEmpty(LTNode* phead)//判断链表是否为空
{
assert(phead);
return phead->next == phead;
}
void LTPopFront(LTNode*phead) //头删
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* first = phead->next;
LTNode* firstNext = first->next;
phead->next = firstNext;
firstNext->prev = phead;
free(first);
first = NULL;
}
2.7删除链表的尾部
void LTPopBack(LTNode* phead)//尾删
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* tail = phead->prev;
LTNode* tailprev = tail->prev;
phead->prev = tailprev;
tailprev->next = phead;
free(tail);
tail = NULL;
}
2.8在pos插入数据
void LTInsert(LTNode* pos, LTDataType x)//插入
{
assert(pos);
LTNode* newnode = BuyLTNode(x);
LTNode* posFirst = pos->prev;
newnode->next = pos;
pos->prev = newnode;
posFirst->next = newnode;
newnode->prev = posFirst;
}
2.9删除一个节点
void LTErase(LTNode* pos)//删除节点
{
assert(pos);
LTNode* posprev = pos->prev;
posprev->next = pos->next;
pos->next->prev = posprev;
free(pos);
pos = NULL;
}
2.10查找一个节点
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;
}
2.11销毁链表
void LTDestroy(LTNode* phead) //链表销毁
{
LTNode* cur = phead->next;
while (cur != phead)
{
LTNode* Next = cur->next;
free(cur);
cur = NULL;
}
}
2.12打印节点每个数据
void LTPrint(LTNode* phead) //打印
{
LTNode* cur = phead->next;
while (cur != phead)
{
printf("%d=>", cur->data);
cur = cur->next;
}
printf("\n");
}
3.完整代码
3.1 List.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"List.h"
LTNode * BuyLTNode(LTDataType x) //�����µĽڵ�
{
LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
if (newnode == NULL)
{
perror("malloc fail");
return NULL;
}
newnode->prev = NULL;
newnode->next = NULL;
newnode->data = x;
return newnode;
}
LTNode* LTInit() //��ʼ��
{
LTNode* head = BuyLTNode(-1);
head->prev = head;
head->next = head;
return head;
}
void LTPushBack(LTNode* phead,LTDataType x) //�
{
assert(phead);
/*LTNode* newnode = BuyLTNode(x);
LTNode* tail = phead->prev;
phead->prev = newnode;
tail->next = newnode;
newnode->prev = tail;
newnode->next = phead;*/
LTInsert(phead, x);
}
bool LTEmpty(LTNode* phead)//�ж������Ƿ�Ϊ��
{
assert(phead);
return phead->next == phead;
}
void LTPopBack(LTNode* phead)//βɾ
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* tail = phead->prev;
LTNode* tailprev = tail->prev;
phead->prev = tailprev;
tailprev->next = phead;
free(tail);
tail = NULL;
}
void LTPopFront(LTNode*phead) //ͷɾ
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* first = phead->next;
LTNode* firstNext = first->next;
phead->next = firstNext;
firstNext->prev = phead;
free(first);
first = NULL;
}
void LTPushFront(LTNode* phead,LTDataType x)//ͷ��
{
assert(phead);
/*LTNode* newnode = BuyLTNode(x);
LTNode* first = phead->next;
phead->next = newnode;
newnode->prev = phead;
newnode->next = first;
first->prev = newnode;*/
LTInsert(phead->next, x);
}
void LTInsert(LTNode* pos, LTDataType x)//����
{
assert(pos);
LTNode* newnode = BuyLTNode(x);
LTNode* posFirst = pos->prev;
newnode->next = pos;
pos->prev = newnode;
posFirst->next = newnode;
newnode->prev = posFirst;
}
void LTErase(LTNode* pos)//ɾ���ڵ�
{
assert(pos);
LTNode* posprev = pos->prev;
posprev->next = pos->next;
pos->next->prev = posprev;
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;
}
void LTDestroy(LTNode* phead) //��������
{
LTNode* cur = phead->next;
while (cur != phead)
{
LTNode* Next = cur->next;
free(cur);
cur = NULL;
}
}
void LTPrint(LTNode* phead) //��ӡ
{
LTNode* cur = phead->next;
while (cur != phead)
{
printf("%d=>", cur->data);
cur = cur->next;
}
printf("\n");
}
3.2 List.h
#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int LTDataType;
typedef struct ListNode
{
struct ListNode* prev;
struct ListNode* next;
LTDataType data;
}LTNode;
LTNode* LTInit();//��ʼ��
void LTPushBack(LTNode* phead,LTDataType x);//�
void LTPrint(LTNode* phead);//��ӡ
LTNode* BuyLTNode(LTDataType x); //�����µĽڵ�
void LTPopBack(LTNode* phead);//βɾ
void LTPopFront(LTNode* phead);//ͷɾ
void LTPushFront(LTNode* phead, LTDataType x);//ͷ��
void LTInsert(LTNode* pos, LTDataType x);//������posλ��֮ǰ��������
void LTErase(LTNode* pos);//ɾ�������ڵ�λ�õ�
LTNode* LTFind(LTNode* phead, LTDataType x);//����
void LTDestroy(LTNode* phead); //��������