_(:зゝ∠)_气哭的约瑟夫单链表问题

#include <stdlib.h>
#include <stdio.h>
#include <malloc.h>
#define N 100
//********** Specification of josephus **********
struct person
{ int num;
struct person *next;//link
};
typedef struct person PERSON;
int josephus(int n,int k)
/* PreCondition:
n and k are positive integer,and k
PostCondition:
return the number of lucky survivor(counting from 1 to n)
*/
{ //TODO: your function definition
int i;
PERSON*tail=NULL;
PERSON*head=NULL;
PERSON*p;
for (i=1;i<=n;i++)
{
p=(PERSON*)malloc(sizeof(PERSON));
p->num=i;
if (head == NULL)
{
head =tail= p;
p->next=p;//首尾相连
}
else
{
tail->next=p;
tail=p; //p结点作为新的尾巴
p->next=head; //首尾相连
}
}
PERSON *p1;PERSON *p2;
for (p1=head;p1->next!=p1;p1=p1->next) //一直执行到只剩下一个数
{
for(i=0;i<k-1;i++)
{p2=p1;p1=p1->next;} //删除第k个节点QWQ
p2->next=p1->next;
free(p1);
p1=p2->next; //让p1继续往后挪
}
return (p1->num);
}
/***************************************************************/
int main()
{ int n,k;
scanf("%d%d",&n,&k);
//********** josephus is called here ************
printf("%d\n",josephus(n,k));
//***********************************************
return 0;
}

不知为什么就是和答案不一样是我的算法错了吗
先建立一个循环链表
然后数到k就删掉那个节点
然后循环到只剩一个数……

for (p1=head;p1->next!=p1;p1=p1->next)
修改为
for (p1=head; p1->next!=p1;)
试试。