用单链表模拟实现约瑟夫环

• 函数

// 用单链表模拟实现约瑟夫环 
void JosephCircle(PNode* ppHead, size_t M)
{
    PNode car = NULL;
    PNode Del = NULL;
    int  num = M;
    assert(ppHead);
    car = (*ppHead);

    if(M != 1)
    {
        while (car->_pNext != car)
        {
            num = M;
            while (--num > 1)
            {
                car = car->_pNext;
            }
            Del = car->_pNext;
            car->_pNext = Del->_pNext;
            car = car->_pNext;
            free(Del);
        }
        car->_pNext = NULL;
        (*ppHead) = car;
    }
    else if (M == 1)
    {
        PNode pre = (*ppHead);
        while (car->_pNext != pre)
        {
            Del = car;
            car = Del->_pNext;
            free(Del);
        }
        car->_pNext = NULL;
    }
    (*ppHead) = car;
}

• 测试函数

// 用单链表模拟实现约瑟夫环 测试
void JosephCircle_test() 
{
    PNode pHead;
    printf("-----模拟实现约瑟夫环测试-----------------\n");
    printf("原始链表: ");
    SListInit(&pHead);
    SListPushBack(&pHead, 0);
    SListPushBack(&pHead, 1);
    SListPushBack(&pHead, 2);
    SListPushBack(&pHead, 3);
    SListPushBack(&pHead, 4);
    SListPushBack(&pHead, 5);
    SListPushBack(&pHead, 6);
    SListPrint(pHead);
    Find(pHead, 6)->_pNext = pHead;
    JosephCircle(&pHead, 4);
    printf("测试结果: ");
    SListPrint(pHead);
    printf("\n");
}

• 测试结果