C语言用循环链表解决约瑟夫问题

约瑟夫问题：1000个数字，每隔2个数字删除一个数，请问最后删除的一个数为多少？

循环链表实现代码请参见：用C语言实现循环链表
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> #include "CircleLinkList.h" #define M 1000 #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 CIRCLELINKLIST_TRUE; } return CIRCLELINKLIST_FALSE; } int main(void){ //创建循环链表 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("\n"); int index = 1; //辅助指针 CircleLinkNode* pCurrent = clist->head.next; while (Size_CircleLinkList(clist) > 1){ 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; if (pCurrent == &(clist->head)){ pCurrent = pCurrent->next; } index++; } if (Size_CircleLinkList(clist) == 1){ MyNum* tempNum = (MyNum*)Front_CircleLinkList(clist); printf("%d ",tempNum->val); } else{ printf("出错!"); } printf("\n"); //释放链表内存 FreeSpace_CircleLinkList(clist); system("pause"); return 0; }