首先是约瑟夫问题
代码来自鱼C工作室
typedef struct node
{
int data;
struct node *next;
}node;
node *create(int n)
{
node *p = NULL, *head;
head = (node*)malloc(sizeof(node));
p = head;
node *s;
int i = 1;
if(n)
{
while( i<=n )
{
s = (node*)malloc(sizeof(node));
s->data = i++;
p->next = s;
p = s;
}
s->next = head->next;
}
free(head);
return s->next;
}
int main()
{
int n = 41;
int m = 3;
int i;
node *p = create(n);
node *temp;
m %= n;
while(p!=p->next) //判断循环链表不为空的方法
{
for( i=1; i<m-1; i++ )
p = p->next;
printf("%d->",p->next->data);
temp = p->next;
p->next = temp->next;
free(temp);
p = p->next;
}
printf("%d\n", p->data);
return 0;
}
进阶版的问题是这样的:编号1–n个人,每人一个密码(可输入),开始人选一个正整数作为报数上限m,从第一个开始按顺序报,报到m停止,m出列并将其密码作为新的m,直到全部人出列。
以下代码是自己写的。
重新写了创建循环链表的部分
node *createx(int n)
{
node *p = NULL, *head;
head = (node*)malloc(sizeof(node));
p = head;
node *s;
int i = 1;
int x;
if(n)
{
while( i<=n )
{
s = (node*)malloc(sizeof(node));
printf("第%d个结点数据是:",i++);
scanf("%d",&x);
s->data = x;
p->next = s;
p = s;
}
s->next = head->next;
}
free(head);
return s->next;
}
main函数部分:
int main()
{
int n;
printf("输入循环链表长度:");
scanf("%d",&n);
node *p = createx(n);
int m;
printf("输入报数上限m:");
scanf("%d",&m);
int i;
while(p!=p->next)
{
for( i=1; i<m-1; i++)
p = p->next;
m = p->next->data;
printf("%d->",p->next->data);
node *temp = p->next;
p->next = temp->next;
free(temp);
p = p->next;
}
printf("%d\n",p->data);
return 0;
}