Josephus问题/圆桌问题--数据结构_采用顺序表、链表解决

顺序表：

//jos_seq.h头文件

#include<stdio.h>
#include<stdlib.h>

#define FALSE 0
#define Maxnum 100
#define TRUE 1

//#define MAXNUM 100
typedef int DataType;

struct SeqList{
	int MAXNUM;
	int n;
	DataType *element;
};
typedef struct SeqList *PSeqList;

PSeqList createNullList_seq(int m)
{
	PSeqList palist = (PSeqList)malloc(sizeof(struct SeqList));
	if(palist!=NULL){
		palist->element = (DataType *)malloc(sizeof(DataType)*m);
		if(palist->element ){
			palist->MAXNUM  = m;
			palist->n = 0;
			return palist;	
		}
		else free(palist);
	}
	printf("Out of space!!\n");
	return NULL;
}

int isNullList_seq(PSeqList palist)
{
	return(palist->n == 0);
}

int locate_seq(PSeqList palist,DataType x)
{
	int q;
	for(q=0;q<palist->n;q++)
	{
		if(palist->element[q] == x)return q;
	}
	return -1;
}

int insertPre_seq(PSeqList palist,int p,DataType x)
{
	int q;
	if(palist->n >= palist->MAXNUM){
		printf("Overflow!\n");
		return 0;
	}
	if(p<0||p>palist->n){
		printf("Not exist!\n");
		return 0;
	}
	for(q=palist->n-1;q>=p;q--)
	{
		palist->element[q+1] = palist->element[q];
	}
	palist->element[p] = x;
	palist->n = palist->n+1;
	return 1;
}

int insertPost_seq(PSeqList palist,int p,DataType x)
{
	int q;
	if(palist->n >= palist->MAXNUM ){
		printf("Overflow!\n");
		return 0;
	}
	if(p<0||p>palist->n){
		printf("No exist!\n");
		return 0;
	}
	
	for(q=palist->n-1;q>p;q--)
	{
		palist->element[q+1] = palist->element[q];
	}
	palist->element[p+1] = x;
	palist->n = palist->n+1;
	return 1;
}

int deleteP_seq(PSeqList palist,int p){
	int q;
	if(p<0||p>palist->n-1){
		printf("Not exist!\n");
		return 0;
	}
	for(q=p;q<palist->n-1;q++)
	{
		palist->element[q] = palist->element[q+1];
	}
	palist->n = palist->n-1;
	return 1;
}

void listprin(PSeqList palist)
{
	int i;
	for(i=0;i<palist->n;i++)
	{
		printf("%d ",palist->element[i]);
	}
}


void josephus_seq(PSeqList palist,int s,int m)
{
	int s1,i,w;
	s1 = s-1;
	for(i=palist->n;i>0;i--)
	{
		s1 = (s1+m-1)%i;
		w = palist->element [s1];
		printf("Out element %d\n",w);
		deleteP_seq(palist,s1);
	}
}

#include<iostream>
#include"jos_seq.h"
using namespace std;

int main()
{
	PSeqList jos_alist;
	int i,k;
	int n,s,m;
	printf("\n please input the value(<100) of n =");
	scanf("%d",&n);
	printf("please input the values of s=");
	scanf("%d",&s);
	printf("please input the values of m=");
	scanf("%d",&m);
	jos_alist = createNullList_seq(n);
	if(jos_alist!=NULL)
	{
		for(i=0;i<n;i++)
		{
			insertPre_seq(jos_alist,i,i+1);
		}
		josephus_seq(jos_alist,s,m);
		free(jos_alist->element);
		free(jos_alist);
	}
	
	return 0;
}

链表解决：

#include<stdio.h> 
#include<stdlib.h>

#define FALSE 0
#define TRUE 1

typedef int DataType;
struct Node;
typedef struct Node *PNode;
struct Node{
	DataType info;
	PNode link;
};

typedef struct Node *LinkList;
typedef LinkList *PLinkList;

int init_clist(PLinkList pclist,int n)
{
	PNode p,q;
	int i;
	q=(PNode)malloc(sizeof(struct Node));
	if(q == NULL)return FALSE;
	*pclist = q;
	q->info = 1;
	q->link  = q;
	if(n == 1)return TRUE;
	for(i=2;i<n+1;i++)
	{
		p = (PNode)malloc(sizeof(struct Node));
		if(p == NULL)return FALSE;
		p->info = i;
		p->link = q->link ;
		q->link = p;
		q = p;
	}
	return TRUE;
}

void josephus_clist(PLinkList pclist,int s,int m)
{
	PNode p,pre;
	int i;
	p = *pclist;
	if(s == 1){
		pre = p;
		p = p->link ;
		while(p!=*pclist){
			pre = p;
			p = p->link ;
		}
	}
	else{
		for(i=1;i<s;i++)
		{
			pre = p;
			p = p->link ;
		}
	}
	while(p!=p->link){                 //当链表中结点个数大于1时
		for(i=1;i<m;i++)               //从第一个开始逐个找 
		{
			pre = p;
			p = p->link ;
		} 
		printf("Out element: %d\n",p->info );
		if(*pclist == p)                       //该结点是第一个结点时，需要特殊处理 
		{
			*pclist = p->link ; 
		}
		pre->link = p->link;                   //删除p结点
		free(p);
		p = pre->link ; 	
	}
	printf("Out element:%d\n",p->info );
	*pclist = NULL;
	free(p);	
}

int main()
{
	LinkList jos_clist;
	int n,s,m;
	do{
		printf("\n please input the values of n=");
		scanf("%d",&n);
	}while(n<1);
	do{
		printf("\n please input the values of s=");
		scanf("%d",&s);
	}while(s<1);
	do{
		printf("\n please input the values of m=");
		scanf("%d",&m);
	}while(m<1);
	
	if(init_clist(&jos_clist,n))
	{
		josephus_clist(&jos_clist,s,m);
	}
	else
		printf("Out of space!\n");
	return 0;
	
}