链表实现约瑟夫环

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。

代码实现：

#include <iostream>
using namespace std;


struct Node
{
int data;
Node * next;
};


class Josephus
{
private:
Node * rear;
public:
Josephus(){
rear = new Node;
rear->next = NULL;
}


Josephus(int n)// 构造循环单链表
{
Node * s = new Node;
Node * p = s;
s->data = 1;
rear = s;
for (int i = 2; i <= n; i++)
{
s = new Node;
s->data = i;
rear->next = s;
rear = s;
}
rear->next = p;
}


void choose(int k)
{
rear = rear->next;//rear指向头
while (rear)
{
for (int i = 1; i<k; i++)
{
rear = rear->next;
}


Node * p = rear->next;
if (p)
{
cout << rear->data << " ";
rear->data = p->data;
rear->next = p->next;
if (p == rear)
rear = NULL;
delete p;
}
}
cout << endl;
}
};


int main()
{
Josephus jos(10);
jos.choose(3);
system("pause");
return 0;
}

图解：

运行结果：