使用VS2019编译双向循环链表

简单的实现双向循环链表的初始化、插入、删除、头插、尾插、头删、尾删操作（只是个人的学习记录）

typedef int Elmtype;
typedef struct Node
{
Elmtype data;
struct Node* prior, * next;
}Llist;

void Init_Llist(Llist* head);初始化
void Insert_Llist(Llist* head, int pos, Elmtype val);插入
void Show(Llist* head);打印链表
void Inserthead(Llist* head,Elmtype val);头插
void Inserttail(Llist* head, Elmtype val);尾插
void DeleteLlist(Llist* head, int pos);删除
void Deletehead(Llist* head);头删
void Deletetail(Llist* head);尾删

功能实现代码
#include"looplist.h"
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

void Init_Llist(Llist* head)
{
if (head == NULL)exit(0);

head->next = head;
head->prior = head;

}
void Show(Llist* head)
{

if (head == NULL)exit(0);
Llist* p = head;
printf("正序输出\n");
while (p->next != head)
{
	printf("%d-->", p->next->data);
	p = p->next;
}
printf("head\n");
printf("逆序输出\n");
while (p != head)
{
	printf("%d-->", p->data);
	p = p->prior;
}
printf("head\n");

}

void Insert_Llist(Llist* head, int pos, Elmtype val)
{
if (head == NULL)exit(0);
if (pos < 0)exit(0);

Llist* p = head;

	while (pos && p != head)
	{
		p = p->next;
		pos--;
	}
	
	Llist* s = (Llist*)malloc(sizeof(Llist));
	if (s == NULL)return;
	s->data = val;
	s->prior = p;
	s->next = p->next;
	
	p->next->prior = s;
	p->next = s;		

}
void Inserthead(Llist* head, Elmtype val)
{
Insert_Llist(head, 0, val);
}

void Inserttail(Llist* head, Elmtype val)
{
if (head == NULL)exit(0);

Llist* p = head;
Llist* s = (Llist*)malloc(sizeof(Llist));
if (s == NULL)return;
s->data = val;
s->next = head;
s->prior = head->prior;
head->prior->next = s;
head->prior = s;

}
void DeleteLlist(Llist* head, int pos)
{
if (head == NULL)exit(0);
if (pos < 0)exit(0);

Llist* p = head;
Llist* q = p->next;

while (pos && p != head)
{
	p = p->next;
	pos--;
}
q->next->prior = p;
p->next = q->next;
free(q);

}
void Deletehead(Llist* head)
{
DeleteLlist(head, 0);
}
void Deletetail(Llist* head)
{
if (head == NULL)exit(0);

Llist* p = head;
Llist* q = p->prior;
if (p->prior == head)
{
	printf("list is empty\n");
	return;
}
p->prior = q->prior;
q->prior->next = head;
free(q);

}