对小甲鱼数据结构18讲约瑟夫问题代码的略微修改
本帖最后由 圣狄雅哥 于 2017-12-5 21:30 编辑//n个人围圈报数,报m出列,最后剩下的是几号?
#include <stdio.h>
#include <stdlib.h>
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( 0 != n )
{
while( i <= n )
{
s = (node *)malloc(sizeof (node));
s->data = i++; // 为循环链表初始化,第一个结点为1,第二个结点为2。
p->next = s;
p = s;
}
s->next = head->next;
}
free(head);
return s->next ;
}
int main()
{
int n ;
int m;
int i;
printf("Please enter n:\n");
scanf("%d",&n);
printf("Please enter m:\n");
scanf("%d",&m);
node *p = create(n);
node *temp;
while (p != p->next )
{
for (i = 1; i < m-1; i++)
{
p = p->next ;
}
printf("%d->", p->next->data );
temp = p->next ; //删除第m个节点
p->next = temp->next ;
free(temp);
p = p->next ;
}
printf("%d\n", p->data );
return 0;
}
小甲鱼老师课件中有:m %= n; // m在这里是等于2
这里是错误的,应该删除这行代码。
页:
[1]