循环链表应用之约瑟夫环

   

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
typedef struct node
{
    char data;
    struct node *next;
}slink,*ad;
ad createlink(slink *head)
{
    slink *p,*s;
    int n;
    cout<<"输入链表长度:"<<endl;
    cin>>n;
    p=head=(slink*)malloc(sizeof(slink));
    int i;
    cout<<"输入链表元素:"<<endl;
    for(i=0;i<n;i++)
    {
        s=(slink*)malloc(sizeof(slink));
        cin>>s->data;
        p->next=s;
        p=s;
    }
    p->next=head;
    return head;
}
void print(slink *head)
{
    slink *p;
    cout<<"最后的编号为:";
    for(p=head->next;p!=head;p=p->next)
    printf("%c ",p->data);
    cout<<"\n";
}
ad delete1(slink *head,int i)
{
    slink *p;
    for(p=head;p->next!=head;)
    {
         if(p->next->data==i)
         break;
         p=p->next;
    }
    if(p->next==head)
    {
        printf("输入错误！\n");
        return NULL;
    }
    slink *q;
    q=p->next;
    p->next=q->next;
    free(q);
    return p;
}
void chang(slink *head)
{
    slink *p;
    int k=0;
    for(p=head;head->next->next!=head;)
    {
        p=p->next;
        if(p!=head)
        k++;
        if(k==3)
        {
            k=0;
            p=delete1(head,p->data);
        }
    }
}
int main()
{

    slink *he;
    he=createlink(he);
    chang(he);
    print(he);
    return 0;
}