数据结构-循环链表

数据结构Josephus问题

问题：

41个人围成一个圈，一次报数，报数为3的出列。

//josephus.c    
#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
    int data;
    struct node *next;
}node;

node *creat(int n)
{
    int i = 1;
    node *p = NULL, *head;
    head = (node*)malloc(sizeof (node));
    p = head;
    node *s;

    if(0 != n)
    {
        while( i <=n )
        {
            s = (node *)malloc(sizeof (node));
            s->data = i++;//为循环链表的初始化，第一个结点为1，第二个结点为2
            p->next = s;
            p = s;

        }
        s->next = head->next;
    }
    free(head);

    return s->next;
}

int main()
{
    int n = 41;
    int m = 3;
    int i;
    node *p = create(n);
    node *temp;

    m %= n;//m在这里等于2  m=m%n;

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

        }

        printf("%d->",p->next->data );
        temp = p->next;//删除第m个结点
        p->next = temp->next;

        free(temp);

        p = p->next
    }

    printf("%d\n",p->data);

    return 0;
}