Josephus约瑟夫问题



假设n个竞赛者排成一个环形，依次顺序编号1，2，…，n。从某个指定的第1号开始，沿环计数，每数到第m个人就让其出列，且从下一个人开始重新计数，继续进行下去。这个过程一直进行到所有的人都出列为止。最后出列者为优胜者。

常规思路：用循环单链表模拟此操作过程，参考代码如下：

int Josephus(int n, int m)
{
	node *pHead = NULL, *pTail = NULL;
	pHead = (node *)malloc(sizeof(node));
	if (NULL == pHead) //申请内存失败，返回NULL
	{
		return NULL;
	}

	pTail = pHead;
	for (int i = 1; i < n; i++) //构造循环链表
	{
		pTail->data = i;
		pTail->pNext = (node *)malloc(sizeof(node));
		pTail = pTail->pNext;
	}
	pTail->data = n;
	pTail->pNext = pHead; //首尾相连

	m %= n;
	//循环取数
	while (pTail != pHead)
	{
		for (int i = 1; i < m; i++)
		{
			pTail = pHead;
			pHead = pHead->pNext;
		}

		pTail->pNext = pHead->pNext;
		free(pHead); //从链表中删除第m个节点
		pHead = pTail->pNext;
	}

	int winner = pHead->data;
	free(pHead); //释放申请的空间
	pHead = NULL;
	pTail = NULL;

	return winner;

}

int main()
{
	int winner = Josephus(6, 5);
	cout << winner << endl;
}