约瑟夫问题(动态链表，静态链表，STL链表)

问题描述：n 个人围成一圈，从第一个人开始报数,数到 m 的人出列，再由下一个人重新从 1 开始报数，数到 m 的人再出圈，依次类推，直到所有的人都出圈，请输出依次出圈人的编号。

第一种动态链表

#include<stdio.h>
#include<stdlib.h>
struct node
{
	int data;
	struct node* next;
};
int main()
{
	int i;
	int n, m;
	struct node* head, * p, * now, * pre;
	scanf("%d%d", &n, &m);

	head = (struct node*)malloc(sizeof(struct node));
	now = head;
	head->data = 1;
	head->next = NULL;
	for (i = 2; i <= n; i++)
	{
		p = (struct node*)malloc(sizeof(struct node));
		p->data = i;
		p->next = NULL;
		now->next = p;
		now = p;
	}
	now->next = head;  //建立循环链表

	pre = head;
	now = head;
	while (n>1)
	{
		for (i = 1; i < m; i++)
		{
			pre = now;
			now = now->next;
		}
		printf("%d ", now->data);
		pre->next = now->next;
		free(now);
		now = pre->next;
		n--;
	}
	printf("%d", now->data);  //这一步是为了不打印空格
	free(now);
	return 0;
}

第三种静态链表，也就是数组

可以用结构体数组，也可以用一维数组

首先结构体数组

#include<stdio.h>
#define N 100
struct node
{
	int id;
	int nextid;
}nodes[N];
int main()
{
	int n, m;
	int pre = 1, now = 1;
	int i;
	scanf("%d%d", &n, &m);
	nodes[0].nextid = 1; //也可以不加这句代码

	for (i = 1; i <= n; i++)
	{
		nodes[i].id = i;
		nodes[i].nextid = i + 1;
	}
	nodes[n].nextid = 1;

	while (n > 1)
	{
		for (i = 1; i < m; i++)
		{
			pre = now;
			now = nodes[now].nextid;
		}
		printf("%d ", nodes[now].id);
		nodes[pre].nextid = nodes[now].nextid;
		now = nodes[now].nextid;
		n--;
	}
	printf("%d", nodes[now].id);
	return 0;
}

然后是一维数组

#include<stdio.h>
#define N 100
int nodes[N]; //数组里面存储的是下一个结点的id

int main()
{
	int n, m;
	int i;
	int pre = 1, now = 1;
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++)
	{
		nodes[i] = i + 1;
	}
	nodes[n] = 1;

	while (n > 1)
	{
		for (i = 1; i < m; i++)
		{
			pre = now;
			now = nodes[now];
		}
		printf("%d ", now);
		nodes[pre] = nodes[now];
		now = nodes[pre];
		n--;
	}

	printf("%d", now);
	return 0;
}

第三种STL链表

C++的内容，我没学过C++啊，等我去学完C++再写这个代码。