约瑟夫问题的链表实现

最新推荐文章于 2024-07-22 20:42:27 发布

CHINAonlyQiu

最新推荐文章于 2024-07-22 20:42:27 发布

阅读量723

点赞数

CC 4.0 BY-SA版权

分类专栏：我非我想

本文链接：https://blog.youkuaiyun.com/CHINAonlyQiu/article/details/10224365

我非我想专栏收录该内容

7 篇文章

订阅专栏

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

#define LEN sizeof(struct Student)

typedef struct Student{
char name[8];
int num;
char sex[4];
int age;
char Class[6];
char health[10];
struct Student *next;
}student,*studentA;

struct Student *CreatList(student *head,int n){
struct Student *p1,*p2;
int i;
p1=(student *)malloc(LEN);
head=(student *)malloc(LEN);
scanf("%s %d %s %d %s %s",p1->name,&p1->num,p1->sex,&p1->age,p1->Class,p1->health);
head=p2=p1;
for(i=0;i<n-1;i++)
{
  p1=(struct Student *)malloc(LEN);

  scanf("%s %d %s %d %s %s",p1->name,&p1->num,p1->sex,&p1->age,p1->Class,p1->health);
  p2->next=p1;
  p2=p1;
}
p2->next=head;
return head;
}

void search(student *head,int m,int n)
{
struct Student *p,*q;
int i=0;
p=(struct Student *)malloc(LEN);
p=head;
if (m!=1)
{
  while (n!=0)
  {
   for(i=0;i<m-2;i++)
     p=p->next;
   q=p->next;
   p->next=q->next;
   printf("%s %d %s %d %s %s\n",q->name,q->num,q->sex,q->age,q->Class,q->health);
   free(q);
   n--;
   p=p->next;
  }
}
else
{
  while (i<n)
  {
   printf("%s %d %s %d %s %s\n",p->name,p->num,p->sex,p->age,p->Class,p->health);
   p=p->next;
   i++;
  }
}
}
int main()
{
struct Student *head;
int m,n;
scanf("%d %d",&n,&m);
head=(student *)malloc(LEN);
head=CreatList(head,n);
search(head,m,n);
return 0;
}