数据结构 约瑟夫问题

#include template struct CircLinkNode { T data;

CircLinkNode*link;

CircLinkNode(CircLinkNode*next=NULL):link(next){}

CircLinkNode(T d,CircLinkNode*next=NULL):data(d),link(next){} };

template class CircList {

private: int n;

CircLinkNode *h; CircLinkNode*first;

CircLinkNode *current,*front; public: CircList(int m);

void Remove(int m,int k);

};

template

CircList::CircList(int m) {

CircLinkNode *p;

current=new CircLinkNode; current->data=n=m; front=current;

for(int i=m-1;i>0;i--) { }

p=new CircLinkNode(i,current); current=p;

front->link=current; };

template

void CircList::Remove(int m,int k) {

CircLinkNode *s; CircLinkNode *h;

s=front->link; h=NULL; for(int i=0;i

{

for(int j=1;jlink;

}

cout<<\出列的是\h->link=s->link; delete s; s=h->link;

} cout<<\最终剩下的人:\};

template class Josephus {

private:

int num;

int inver; public: Josephus(int i,int j); void jsp(); };

template

Josephus::Josephus(int i,int j) {

num=i; inver=j;

}

template void Josephus:: jsp() {

CircListren(num); ren.Remove( num, inver); };

void main() {

int m,k;

}

cout<<\输入总的人数和报数间隔：\cin>>m>>k;

Josephusjose(m,k); jose.jsp();