约瑟夫问题---单向循环链表

include

using namespace std;

define N 41

define M 3

struct node{

int value;

struct node * next;

};

typedef struct node* Node;

bool initNode(Node *head);

bool insert_tail(Node head, int value);

void print(Node head);

int main()

{

Node head = nullptr;

initNode(&head);

for (int i = 1; i <= N; i++)

{

insert_tail(head, i);

}

print(head);

int remain = N;
int count = 0;//计数器
//while (head != head->next)
Node temp = head;
while (remain >= M)
{
if (temp->next->value != 0)//0表示淘汰出局
{
count++;
if (count >= M)
{
count = 0;
remain -= 1;
temp->next->value = 0;
}
}
temp = temp->next;
if (temp->next == head)//使链表重复遍历
{
temp = head;
}
}
cout << "最终编号不为0胜出" << endl;
print(head);
system("pause");

}

bool initNode(Node *head)

{

Node newnode = (Node)malloc(sizeof(struct node));

if (NULL == newnode)

{

return false;

}

newnode->next = newnode;

*head = newnode;

}

bool insert_tail(Node head, int value)

{

Node temp = head;//固定头结点位置，利用temp去遍历链表

Node newnode = (Node)malloc(sizeof(struct node));

if (NULL == newnode)

{

return false;

}

newnode->value = value;

newnode->next = head;

while (temp->next != head)//temp遍历到链表的尾

{

temp = temp->next;

}

temp->next = newnode;

return true;

}

void print(Node head)

{

Node temp = head;

while (temp->next != head)

{

cout << temp->next->value<<” “;

temp = temp->next;

}

cout << endl;

}