约瑟夫环

#include<stdio.h>
#include<stdlib.h>

#define Error 0
#define OK 1
typedef int ElemType;
typedef int status;

typedef struct Node
{
    ElemType data;
    struct Node *next;
}Node;

//创建约瑟夫环

status Create(Node** node ,int n)
{
    Node* head = (Node*)malloc(sizeof(Node));
    Node *p,*s;
    p = head;
    int i=1;

    if(n<1)
        return Error;
    while(i <= n)
    {
        s= (Node*)malloc(sizeof(Node));
        s->data= i++;
        p->next =s;
        p = s;
    }
    s->next = head->next;
    *node = (head->next);
    free(head);
    return OK;
}

void print(Node *node)
{
    Node* s = node;
    do
    {
        printf("%d
",s->data);
        s = s->next;
    }while(s != node);
}
void main()
{
    Node *list;
    int n = 41;
    int m = 3;
    int i;
    Create(&list,n);
    //print(list);
    Node* temp;

    m %=n;

    while(list != list->next)
    {
        for(i = 1; i<m -1;i++)
        {
            list = list->next;
        }

        printf("%d->",list->next->data);
        temp = list->next;
        list->next = temp->next;

        free(temp);

        list = list->next;
    }
    
    printf("%d
",list->data);
}