数据结构约瑟夫环密码

约瑟夫环密码

注意问题

对于m是1的情况要单独考虑一下，因为你如果要修改第m个，指针一定指向m的前一个才行，所以如若是1，则需要一直遍历找到尾巴

/*
ÉñÆæµÄԼɪ·ò»· 
¾Ý˵ÖøÃûÓÌÌ«Àúʷѧ¼Ò JosephusÓйýÒÔϵĹÊÊ£ºÔÚÂÞÂíÈËÕ¼ÁìÇÇËþÅÁÌغó£¬
39 ¸öÓÌÌ«ÈËÓëJosephus¼°ËûµÄÅóÓѶ㵽һ¸ö¶´ÖУ¬
39¸öÓÌÌ«È˾ö¶¨ÄþÔ¸ËÀÒ²²»Òª±»µÐÈË×¥µ½£¬ÓÚÊǾö¶¨ÁËÒ»¸ö×Ôɱ·½Ê½£¬
41¸öÈËÅųÉÒ»¸öԲȦ£¬ÓɵÚ1¸öÈË¿ªÊ¼±¨Êý£¬Ã¿±¨Êýµ½µÚ3È˸ÃÈ˾ͱØÐë×Ôɱ£¬
È»ºóÔÙÓÉÏÂÒ»¸öÖØб¨Êý£¬Ö±µ½ËùÓÐÈ˶¼×ÔɱÉíÍöΪֹ¡£
È»¶øJosephus ºÍËûµÄÅóÓѲ¢²»Ïë×ñ´Ó¡£Ê×ÏÈ´ÓÒ»¸öÈË¿ªÊ¼£¬
Ô½¹ýk-2¸öÈË£¨ÒòΪµÚÒ»¸öÈËÒѾ­±»Ô½¹ý£©£¬²¢É±µôµÚk¸öÈË¡£
½Ó×Å£¬ÔÙÔ½¹ýk-1¸öÈË£¬²¢É±µôµÚk¸öÈË¡£Õâ¸ö¹ý³ÌÑØ×ÅԲȦһֱ½øÐУ¬
Ö±µ½×îÖÕֻʣÏÂÒ»¸öÈËÁôÏ£¬Õâ¸öÈ˾ͿÉÒÔ¼ÌÐø»î×Å¡£
ÎÊÌâÊÇ£¬¸ø¶¨Á˺ͣ¬Ò»¿ªÊ¼ÒªÕ¾ÔÚʲôµØ·½²ÅÄܱÜÃâ±»´¦¾ö£¿
JosephusÒªËûµÄÅóÓÑÏȼÙ×°×ñ´Ó£¬
Ëû½«ÅóÓÑÓë×Ô¼º°²ÅÅÔÚµÚ16¸öÓëµÚ31¸öλÖã¬ÓÚÊÇÌÓ¹ýÁËÕⳡËÀÍöÓÎÏ·
*/ 
#include<stdio.h>
#include<stdlib.h>
const int maxn=1000;
typedef struct Josephus
{
	int data;
	int Password; 
	struct Josephus *next;
}Josephus;
Josephus* Build(int n)
{
	Josephus  *p,*q;
	Josephus *head=(Josephus*)malloc(sizeof(Josephus));
	if(!head)
	{
		printf("ÉêÇë¿Õ¼äʧ°Ü£¡\n");
		exit(1);
	}
	printf("ÇëÒÀ´ÎÊäÈëÃÜÂ룺\n");
	head->data=1;
	scanf("%d",&head->Password);
	//head->next=NULL;
	p=head;
	for(int i=2;i<=n;i++)
	{
		q=(Josephus*)malloc(sizeof(Josephus));
		if(!q)
	  {
		printf("ÉêÇë¿Õ¼äʧ°Ü£¡\n");
		exit(1);
	  }
	  q->data=i;
	  scanf("%d",&q->Password);
	  p->next=q;
	  p=p->next;
	} 
	p->next=head;
	return head;
}
void simulation_suicide(Josephus *head,int m,int *book) 
{
	Josephus  *p,*q;
	int cnt=1;
	int order=0;
	p=head;
	while(p->next!=p)
	{
		if(m==1)
		{
			q=p;
			while(p->next!=q)
			{
				p=p->next;
			}
			m=q->Password;
			book[order++]=q->data;
			p->next=q->next;
			free(q);
			cnt=0;
			
		}
		else if(cnt==m-1)//¹Ø¼ü 
		{
			q=p->next;
			book[order++]=q->data;
			m=q->Password;
			p->next=q->next;
			free(q);
			cnt=0;
		}
		p=p->next;
		cnt++;
	}
	book[order]=p->data;
}
int main()
{
	int n,m;
	int book[maxn];
	Josephus *head;
	printf("ÇëÊäÈë×ÜÈËÊý\n");
	scanf("%d",&n);
	head=Build(n);
	printf("ÇëÊäÈëmµÄ³õÖµ\n");
	scanf("%d",&m);
	simulation_suicide(head,m,book);
	for(int i=0;i<n;i++)
	{
		printf("%d ",book[i]);
	}
	return 0;
 }