数据结构（七）约瑟夫问题

void LooplistPrint3(looplist *head,int n,int k,int m)  // 8 3 4
{
    looplist *p = head;
    looplist *q;
    int h = 1;
    for(int j = 1; j < k; j++)
    {
            p = p->next;
    }
    int i;
    while(n != 1)
    {
         i = 1;
        while(i < m-1)
        {
            p = p->next;
            i++;
        }
        q = p->next;
        printf("%d : %dn",h++,q->data);
        p->next = q->next;
        p = p->next;
        printf("%d n",p->data);
        free(q);
        n--;
    }
    printf("%dn",p->data);
}