C++单链表实现约瑟夫环.docVIP

#include iostream.h #include stdlib.h struct Member//定义结构体 { int number; int password; Member *next; }; class Joseph { public: Member *frist;//头指针 int size; Joseph(void); ~Joseph(void); int Size(void) const;//返回长度 Member *Index(int i);//定位 void Create(int i);//构造循环单链表 int Delete(int i);//删除结点并返回number的值 }; Joseph::Joseph() { //frist=new Member; Member *p=new Member; frist=p; size=0; } Member *Joseph::Index(int i) { if(i==0)return frist; Member *p=frist-next; int j=1; while(ji) { p=p-next; j++; } return p; } int Joseph::Size(void)const { return size; } void Joseph::Create(int i) { for(int j=1;j=i;j++) { Member *p=Index(j-1); Member *q=new Member; q-number=j; p-next=q; size++; }; //Member *p=Index(i); //p-next=frist; } Joseph::~Joseph(void) { Member *p,*q; p=frist; while(size!=0) { q=p; p=p-next; delete q; size--; } size=0; frist=NULL; } int Joseph::Delete(int i) { Member *s,*p=Index(i-1); s=p-next; p-next=p-next-next; int x=s-number; coutx ; int y=s-password; delete s; size--; return y; } void main(void) { Joseph jos; int i; coutPlease input number of people :endl; cini; jos.Create(i); int frist;//设初始值 coutPlease input the frist number :endl; cinfrist; for(int k=1;k=i;k++)//用循环输入每个人的密码 { coutplease input No.k`s password:endl; Member *b=jos.Index(k); cinb-password; } coutThe final is :endl; int l=frist%i; if (l==0) l=i; for(int b=i-1;b0;b--) { frist=jos.Delete(l); l=(frist+l-1)%b; int e=jos.Size(); if(l==0) l=e; } jos.Delete(l); coutendl; }