关于链表的一个编程
#include<iostream>
using namespace std;
struct Jose
{
int code;
Jose *next;
};
int main()
{
Jose *head,*p1,*p2;
int boys,m,i;
cout<<"请输入小孩人数:";
cin>>boys;
cout<<"请输入数小孩的间隔数:";
cin>>m;
head=new Jose;
head->code=1;
p2=head;
for(i=2;i<=boys;i++)
{
p1=new Jose;
p1->code=i;
p2->next=p1;
p2=p1;
}
p2->next=head;
cout<<"出圈顺序为:"<<endl;
p1=head;
while(p1->next!=p1)
{
i=1;
while(i<m)
{
i++;
p2=p1;
p1=p1->next;
}
p2->next=p1->next;
cout<<p1->code<<" ";
delete p1;
p1=p2->next;
}
cout<<endl<<"优胜者为:"<<p1->code<<endl;
return 0;
}

[解决办法]
啥问题啊 亲