//自建循环链表解决约瑟夫问题
void CircleLinkList::yuesefu(int go_num)
{
CircleLinkNode* curr = head;
CircleLinkNode* prev = nullptr;
while (size > 0)
{
for (int i= 1; i <= go_num; i++)
{
prev = curr;
curr = curr->next;
if (curr == head)
{
curr = head->next;
prev = head;
}
}
prev->next = curr->next;
cout << curr->data << " ";
curr = prev;
size--;
}
}
//自建队列解决约瑟夫问题
void yusefu(int go_num)
{
LinkQueue* link1 = new LinkQueue;
for (int i = 1; i <9; i++)
{