循环链表只是把单链表的最后一个结点指向头结点,本链表增加了一个头结点。
#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
int data;
struct Node *next;
}*Rlist;
int errMemory(Rlist p)
{
if(p==NULL)
{
printf("内存申请失败!\n");
return 0;
}else
{
return 1;
}
}
Rlist init(Rlist head) //建立哨兵结点
{
Rlist p;
p = (Rlist)malloc(sizeof(struct Node));
if(errMemory(p))
{
head = p;
p->next =NULL;
return head;
}
return NULL;
}
Rlist createList(Rlist head)
{
int n,i=1;
Rlist p,p1;
p1= head;
printf("输入数据规模:\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
p=(Rlist)malloc(sizeof(struct Node));
if(errMemory(p)==0)
{
return head;
}
p->data = i;
p1->next = p;
p->next = head->next;
p1 = p;
}
return head;
}
int Length(Rlist head)
{
int len=0;
Rlist p;
p = head->next;
if(head->next==NULL)
{
len = 0;
}else
{
while(p!=NULL)
{
len++;
p = p->next;
if(head->next == p )
{
break;
}
}
}
return len;
}
void print(Rlist head)
{
Rlist p=head->next;
while(p !=NULL)
{
printf("%d ",p->data);
p=p->next;
if(p == head->next)
{
break;
}
}
}
Rlist deletePos(Rlist head,int num)
{
Rlist h,p=head,p1=NULL;
int i;
for(i=1;i<=Length(head);i++)
{
h = p;
p = p->next;
if(p->data == num)
{
if(i==1)
{
p1=head->next;
while(p1!=NULL)
{
if(p1->next==head->next)
{
break;
}
p1 = p1->next;
}
}
h->next = p->next;
if(p1!=NULL)
{
p1->next = p->next;
}
free(p);
break;
}
}
return head;
}
int main()
{
Rlist Head,p,p1;
int i,m,len;
Head =init(Head);
Head = createList(Head);
print(Head);
printf("\n");
printf("输入报数位置:\n");
scanf("%d",&m);
p=Head->next;
printf("出列顺序:\n");
len = Length(Head);
while(len-->0)
{
for(i=1;i<m;i++)
{
p = p->next;
}
printf("%d ",p->data);
p1 = p;
p=p->next;
Head = deletePos(Head,p1->data);
}
return 0;
}