cirlist。h
typedef int ElemType;
typedef int Status;
typedef struct DuLNode
{
ElemType data;
struct DuLNode *prior;
struct DuLNode *next;
}DuLNode,*LinkList;
Status InitList(LinkList &L);
Status DestroyList(LinkList &L);
Status CreatList(LinkList &L,ElemType &e,int i);
Status InsertList(LinkList &L,ElemType &e,int i);
Status DeleteList(LinkList &L,ElemType &e ,int i);
void OutPutList(LinkList L,int i);
crilist。cpp
#include "StdAfx.h"
#include "CircularList.h"
Status InitList(LinkList &L)
{
LinkList p;
L=(LinkList)malloc(sizeof(DuLNode));
p=L;
L->data=NULL;
L->next=p;
L->prior=p;
return OK;
}
Status DestroyList(LinkList &L)
{
LinkList p,q,m;
m=L;
q=L;
p=L->next;
while(p->next==m)
{
free(q);
q=p;
p=p->next;
}
free(p);
return OK;
}
Status CreatList(LinkList &L,ElemType &e,int i)
{
LinkList p,q,s;
int d;
p=q=L;
while(i)
{
scanf("%d",&d);
s=(LinkList)malloc(sizeof(DuLNode));
s->data=d;
p->next=s;
s->prior=p;
s->next=q;
q->prior=s;
p=s;
e++;
i--;
}
return OK;
}
Status InsertList(LinkList &L,ElemType e,int i)
{
LinkList p,s;
int j=1,d;
p=L;
if(p==NULL||i>e)
return ERROR;
while(p&&j>=i)
{
p->next=p;
j++;
}
scanf("%d",&d);
s=(LinkList)malloc(sizeof(DuLNode));
s->data=d;
s->prior=p->prior;
p->prior->next=s;
p->prior=s;
s->next=p;
e++;
return OK;
}
Status DeleteList(LinkList &L,ElemType &e ,int i)
{
LinkList p,s;
int j=1;
p=L;
if(p==NULL||i>e)
return ERROR;
while(p&&j>=i)
{
p->next=p;
j++;
}
s=p;
p->next->prior=p->prior;
p->prior->next=p->next;
free(s);
e--;
return OK;
}
void OutPutList(LinkList L,int i)
{
LinkList p;
p=L->next;
int j;
printf("輸出循環鏈表:\n");
for(j=1;j<i;j++)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
}
主文件：
// CircularList.cpp : Defines the entry point for the console application.
//
#include "StdAfx.h"
#include "CircularList.h"
int main()
{
printf("Hello World!\n");
LinkList List;
int sum=1,i,a[10];
a[0]=InitList(List);
printf("輸入你想創建的循環鏈表長度:\n");
scanf("%d",&i);
a[1]=CreatList(List,sum,i);
OutPutList(List,sum);
return 0;
}