n个人围成一个圈,轮流报数123,报到3就退出这个圈,最后谁会留下来
这里用数据结构的单链表来解决
#include<stdio.h>
#include<stdlib.h>
typedef struct ListNode{
int date;
struct ListNode *next;
}ListNode,*LNode;
enum Status{
OK=1,
ERROR=0
};
long long k=0;
Status InitList(LNode &L,int n)
{//构造一个节点数为n的链式环
struct ListNode *q,*p;
q=L;
q->date=1;
q->next=NULL;
for(int i=2;i<=n;i++){
p=new ListNode;
p->date=i;
q->next=p;
q=p;
q->next=NULL;
}
q->next=L;
return OK;
}
Status Solve(LNode &L)
{//暴力解决
while(L->next!=L){
++k;
if(k%2==0){//当k是偶数的时候删除下一个
ListNode *r;
r=L->next;
printf("k=%lld\n%d out\n",k,r->date);
L->next=r->next;
}
L=L->next;
}
return OK;
}
int main()
{
ListNode *L;
L=new ListNode;
printf("请输入一个数n\n");
int n;
scanf("%d",&n);
InitList(L,n);
printf("初始化完成!\n");
Solve(L);
printf("The problem have solved!\n");
printf("%d have lived!\n",L->date);
return 0;
}