16、约瑟夫问题

M个人围成一圈，从第一个开始报数，第N个将被杀掉，最后剩下一个，其余人都将被杀掉。例如M=10，M=3，被杀掉的顺序是：3,6,9,2,7,1,8,5,10,4.

使用单循环链表实现

API函数和单循环链表一样

main.c

宏定义M为10，N为3

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"CircleLinkList.h"

#define M 10
#define N 3

typedef struct MYNUM {
    CircleLinkNode node;
    int val;
}MyNum;

void MyPrint(CircleLinkNode* data) {
    MyNum* num = (MyNum*)data;
    printf("%d  ",num->val);
}

int MyCompare(CircleLinkNode* data1, CircleLinkNode* data2) {
    MyNum* num1 = (MyNum*)data1;
    MyNum* num2 = (MyNum*)data2;
    if (num1->val == num2->val) {
        return TRUE;
    }
    return FALSE;
}

int main() {

    //创建循环链表
    CircleLinkList* clist = Init_CircleLinkList();
    //链表插入数据
    MyNum num[M];
    for (int i = 0; i < M; i++) {
        num[i].val = i + 1;
        Insert_CircleLinkList(clist, i, (CircleLinkNode*)&num[i]);
    }

    //打印
    Print_CircleLinkList(clist, MyPrint);
    printf("
");


    int index = 1;
    //辅助指针
    CircleLinkNode* pCurrent = clist->head.next;
    while (Size_CircleLinkList(clist) > 1) {
        if (pCurrent == &(clist->head)) {
            pCurrent = pCurrent->next;
        }
        if (index == N) {
            
            MyNum* temNum = (MyNum*)pCurrent;
            printf("%d  ", temNum->val);

            //缓存待删除结点的下一个结点
            CircleLinkNode* pNext = pCurrent->next;

            //根据值删除
            RemoveByValue_CircleLinkList(clist, pCurrent, MyCompare);
            pCurrent = pNext;
            if (pCurrent == &(clist->head)) {
                pCurrent = pCurrent->next;
            }
            
            index = 1;
        }

        pCurrent = pCurrent->next;
        index++;
    }

    if (Size_CircleLinkList(clist) == 1) {
        MyNum* tempNum=(MyNum*)Front_CircleLinkList(clist);
        printf("%d  ",tempNum->val);
    }
    else {
        printf("出错！
");
    }
    printf("
");


    //释放链表内存
    FreeSpace_CircleLinkList(clist);


    system("pause");
    return 0;
}

运行结果：