有n个人围成一圈,顺序排号,从第一个开始报数(从1到3报数),凡报到3的人退出圈子,问最后最后留下的是原来第几号的那位.
提示:用环形链表实现
#include <stdio.h>
#include <stdlib.h>
struct student
{
int num;
struct student * next;
};
typedef struct student Stu;
typedef struct student* Link;
void create_new_node(Link *new_node)
{
*new_node = (Link)malloc(sizeof(Stu));
if(*new_node == NULL)
{
printf("空间分配失败:\n");
exit(-1);
}
}
void create_link(Link *head) //创建代带表头的循环链表
{
create_new_node(head);
(*head)->next = (*head);
}
void insert_new_node_tail(Link head,Link new_node) //采用尾插
{
Link p = head;
while(p->next != head)
{
p = p->next;
}
p->next = new_node;
new_node->next = head;
}
void display_link(Link head)
{
Link p = head->next;
if(head->next == head)
{
printf("the list is empty!\n");
}
else
{
while(p != head)
{
printf("%d\n",p->num);
p = p->next;
}
}
}
Link delete(Link head,int n)
{
int m = 1;
Link p;
Link q;
if(n == 0 || n == 1)
{
return NULL;
}
else //2人以上才满足报数条件
{
p = head->next;
q = p;
while(n > 1)
{
m = 1; //m标记报数为3的人
while(m < 3)
{
if(p == head) //遇到表头跳过,不是表头m才会自加
{
p = p->next;
}
q = p;
p = p->next;
m++;
}
q->next = p->next;
free(p); //删除报数3的人
p = q->next;
n--;
}
return q; //返回最后剩下的那个人的地址
}
}
int main()
{
int n;
int i;
Link head = NULL;
Link new_node = NULL;
Link p;
create_link(&head);
printf("请输入人数:");
scanf("%d",&n);
for(i = 0;i < n;i++)
{
create_new_node(&new_node);
new_node->num = i + 1;
insert_new_node_tail(head,new_node);
}
display_link(head);
p = delete(head,n);
if(p == NULL)
{
printf("不满足报数条件!\n");
}
else
{
printf("剩下的是:%d\n",p->num);
}
return 0;
#include <stdlib.h>
struct student
{
int num;
struct student * next;
};
typedef struct student Stu;
typedef struct student* Link;
void create_new_node(Link *new_node)
{
*new_node = (Link)malloc(sizeof(Stu));
if(*new_node == NULL)
{
printf("空间分配失败:\n");
exit(-1);
}
}
void create_link(Link *head) //创建代带表头的循环链表
{
create_new_node(head);
(*head)->next = (*head);
}
void insert_new_node_tail(Link head,Link new_node) //采用尾插
{
Link p = head;
while(p->next != head)
{
p = p->next;
}
p->next = new_node;
new_node->next = head;
}
void display_link(Link head)
{
Link p = head->next;
if(head->next == head)
{
printf("the list is empty!\n");
}
else
{
while(p != head)
{
printf("%d\n",p->num);
p = p->next;
}
}
}
Link delete(Link head,int n)
{
int m = 1;
Link p;
Link q;
if(n == 0 || n == 1)
{
return NULL;
}
else //2人以上才满足报数条件
{
p = head->next;
q = p;
while(n > 1)
{
m = 1; //m标记报数为3的人
while(m < 3)
{
if(p == head) //遇到表头跳过,不是表头m才会自加
{
p = p->next;
}
q = p;
p = p->next;
m++;
}
q->next = p->next;
free(p); //删除报数3的人
p = q->next;
n--;
}
return q; //返回最后剩下的那个人的地址
}
}
int main()
{
int n;
int i;
Link head = NULL;
Link new_node = NULL;
Link p;
create_link(&head);
printf("请输入人数:");
scanf("%d",&n);
for(i = 0;i < n;i++)
{
create_new_node(&new_node);
new_node->num = i + 1;
insert_new_node_tail(head,new_node);
}
display_link(head);
p = delete(head,n);
if(p == NULL)
{
printf("不满足报数条件!\n");
}
else
{
printf("剩下的是:%d\n",p->num);
}
return 0;