凯立德笔试题求助

[huolianglee]

n个人，从1数到3，每次数到3减去此人，重新开始数到3再退出。问最后一个人几号？
要求用程序实现它，只记得是用链表实现的具体不记得了。

[luciferisnotsatan]

做个环形链表不就行了

[恨天低]

耶瑟夫环？

[小楫轻舟]

google约瑟夫环
其实就是很基本的循环链表删除节点，
直到最后一个

[恨天低]

#include <iostream>
using namespace std;
#define LEN sizeof(struct A)
int main()
{
typedef struct A
{
int num;
struct A * next;
}DATA;

DATA *head, *p1, *p2, *p0;
int i, n;

cin>>n;
for ( i = 1; i <= n; i++)
{
if ( 1 == i)
{
p1 = p2 = (DATA*)malloc(LEN);
head = p1;
head->num = i;
head->next = NULL;
}
else
{
p2 = (DATA *)malloc(LEN);
p1->next = p2;
p2->num = i;
p1 = p2;
}
}

p2->next = head;
p0 = p2;
p1 = head;
p2 = p1->next;

int k = 1;
int num = n;

while (num != 1)
{
p0 = p0->next;
p1 = p1->next;
p2 = p2->next;
k++;

if (3 == k)
{
p0->next = p2;
free(p1);
p1 = p2;
p2 = p2->next;
k = 1;
num--;
}
}

cout<<p1->num;
return 0;
}