循环链表

dlist.h
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
//#include <vld.h>
//断言在release版本无效
//千万不要使用头结点进行查找或比较等
typedef  struct DNode
{
int data;
struct DNode *next;
struct DNode *prio;
}DNode,*DList;

void  InitDList(DList  plist);

void  Insert_Dhead(DList plist,int val);

void  Insert_Dtail(DList plist,int val);

bool  Delete(DList plist,int key);

void  ShowD(DList plist);

int GetlengthD(DList plist);

DNode *  Search(DList plist,int key);

void Destroy(DList plist);
dlist.cpp
#include "dlist.h"
//static:只能本文件使用
//修饰函数，全局变量，局部变量（生命周期从创建时到程序退出）
//初始化循环链表
void  InitDList(DList  plist)
{
assert(plist!=NULL);
plist->next=NULL;
plist->prio=NULL;
}
//申请一个结点
static DNode * BuyDNode(int val)
{
DNode *p=(DNode *)malloc(sizeof(DNode));
assert(p!=NULL);
p->data=val;
p->next=NULL;
p->prio=NULL;
return p;
}
//头插法
void Insert_Dhead(DList plist,int val)
{
DNode *p=BuyDNode(val);
if(plist->next!=NULL)
{

p->next=plist->next;
    plist->next=p;
p->next->prio=p;
p->prio=plist;

}
else
{
plist->next=p;
p->next=NULL;
p->prio=plist;
}
}
//尾插法,比较符合人类习惯
void  Insert_Dtail(DList plist,int val)
{
DNode *p=BuyDNode(val);
DNode *p1;
    for(p1=plist;p1->next!=NULL;p1=p1->next)
{
;
}
p1->next=p;
p->prio=p1;
p->next=NULL;
}

//打印
void ShowD(DList plist)
{
DNode *p;
for(p=plist->next;p!=NULL;p=p->next)
{
printf("%d   ",p->data);
}
printf("\n");
}
//统计链表结点个数
int GetlengthD(DList plist)
{
DNode *p;
int i=0;
for(p=plist->next;p!=NULL;p=p->next)
{
i++;
}
return i;
}
//查找与key值相同的第一个结点

DNode *Search(DList plist,int key)
{
DNode *p;
for(p=plist->next;p!=NULL;p=p->next)
{
if(p->data==key)
{
printf("key=%d\n",p->data);
return p;
}
}

printf("未找到\n");
     return NULL;
}
//删除与key相同的第一个元素
bool  Delete(DList plist,int key)
{
DNode *p;
for(p=plist->next;p!=NULL;p=p->next)
{
if(p->data==key&&p->next==NULL)
{
p->prio->next=NULL;
free(p);
return true;
}
else if(p->data==key&&p->next!=NULL)
{
p->prio->next=p->next;
p->next->prio=p->prio;
return true;
}
}
return false;
}
//销毁
void Destroy(DList plist)
{
DNode *p;
DNode *q;
    for(p=plist->next;p!=NULL;p=p->next)
{
q=p;
    free(q);
}
}

test.cpp
#include "dlist.h"

int main()
{
DNode head;
InitDList(&head);
for(int i=0;i<10;i++)
{
Insert_Dtail(&head,i);
}
ShowD(&head);

printf("length=%d\n",GetlengthD(&head));

Search(&head,8);
Search(&head,10);

printf("%d\n",Delete(&head,8));
printf("%d\n",Delete(&head,10));
ShowD(&head);
    Destroy(&head);
ShowD(&head);

}