循环链表的应用_约瑟夫环

#include <iostream>

using namespace std;

typedef struct _Node
{
string name;
string no;
string gender;
int age;
string classno;
string health;
struct _Node *Next;
}Node;

int getinfo(Node *stu)
{
cin>>stu->name;
cin>>stu->no;
cin>>stu->gender;
cin>>stu->age;
cin>>stu->classno;
cin>>stu->health;
return 0;
}

int printinfo(Node *stu)
{
cout<<stu->name<<" "<<stu->no<<" "<<stu->gender<<" "<<stu->age<<" "<<stu->classno<<" "<<stu->health<<endl;
return 0;
}

int main()
{
int totalnum, upno;
string _name;
cin>>totalnum>>upno;
//creat head node
Node *head,*s,*p,*q;
head=new Node;
getinfo(head);
p=head;
p->Next=p;
//insert other node
for (int i=2;i<=totalnum;i++)
{
s=new Node;
getinfo(s);
s->Next=p->Next;
p->Next=s;
p=p->Next;
}
p=q=head;
int currno=totalnum;
while(currno!=1)
{
for(int j=1;j<upno;j++)
{
p=p->Next;//p direct the node to be deleted
}
printinfo(p);
while(q->Next!=p)
{
q=q->Next;//q is the pre node of p
}
//delete p
q->Next=p->Next;
//store p
s=p;
//move p to the next position
p=p->Next;
delete(s);
currno--;
}
printinfo(p);
delete(p);
//printinfo(head);
return 0;
}