.1000只猴子,编号1到1000,连成一个圆圈,从中任取一个,由一个方向从1数到3,将3清除出去,这样循环下去,问最后会留下那个?
循环队列轮询解决问题
#include <stdio.h>
#include <stdlib.h>
typedef struct _Node
{
int value;
struct _Node *next;
}Node;
fun_yuesefu(int n ,int m)
{
Node* list = (Node*)malloc(sizeof(Node)*n);
for(int i=0;i<n;i++)
{
if(i != (n-1))
{
list[i].value = i+1;
list[i].next = &list[i+1];
}
else
{
list[i].value = i;
list[i].next = &list[0];
}
}
Node *cur = &list[0];
Node *pre = &list[n-1];
int count = 0;
while(pre != cur)
{
count++;
if(count == m)
{
count = 0;
pre->next = cur->next;
cur = cur->next;
}
else
{
pre = cur;
cur = cur->next;
}
}
printf("---%d----\n",cur->value);
free(list);
return cur->value;
}
int main()
{
int result;
result = fun_yuesefu(1000,3);
printf("the result is %d\n",result);
return 0;
}