SWUST OJ(956)

约瑟夫问题的实现

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

typedef struct LNode
{
    int data;
    struct LNode *next;
}LinkList;

void CreateList(LinkList *& L, int l)
{
    L =(LinkList*)malloc(sizeof(LinkList));
    LinkList *r;
    r = L;
    r->next = L;
    LinkList * p;

    for (int i = 0; i < l; ++i)
    {
        p =(LinkList*)malloc(sizeof(LinkList));
        p->data = i+1;
        p->next = L;
        r->next = p;
        r = p;
    }
}

LinkList* find(LinkList *p, int n, int &e, LinkList *L)
{
    LinkList * r;
    r = p;
    for(int i = 0;i<n-1; i++)
    {
        r = r->next;
        if (r == L)
        {
            r = r->next;
        }
    }
    LinkList * q;
    if (r->next == L)
    {
        q = r->next->next;
    }
    else
    {
        q = r->next;
    }
    e = q->data;
    r->next = q->next;
    return q;
}

int main(int argc, char const *argv[])
{
    LinkList *L;
    int n,k;
    scanf("%d",&n);
    scanf("%d",&k);
    CreateList(L,n);
    int e;
    LinkList* p;
    p = L;
    for (int i = 0; i < n; ++i)
    {
        p = find(p,k,e,L);
    }
    printf("%d",e);
    return 0;
}