约瑟夫环.txt

一个模拟约瑟夫环的程序

#include "iostream.h"

struct lian
{
int zhi;
lian * next;
lian ()
{
zhi=0;
next=NULL;
}


};
//----------------------------------------------------------
lian * creat(int & length)// 链表创建函数
{
cout<<" 请输入链表的长度"<<endl;

cin>>length;
lian * top,*wei,*jiedian;

top=wei=new lian;
for (int i=1;i<=length;i++)
{
 jiedian=new lian;
 cout<<"请输入第"<<i<<"个节点的数值"<<endl;
 cin>>jiedian->zhi;
 wei->next=jiedian;
 wei=jiedian;
 

}//----------------------for语句结尾

top=top->next;
wei->next=top;

return top;



}

//------------------------------------------------------------------------

ostream& operator << (ostream& cout,lian * a)
{
for (;a!=NULL;)
{
	cout<<a->zhi<<"  "<<endl;
	a=a->next ;
}

return cout;

}



main()
{
lian *a;
int len;
a=creat(len);
cout<<len;
int m;

cout<<"请输入m的值";
cin>>m;
int j=1;
for(int i=m;len>=1;)
{ 
  if(j==i)
  {
  cout<<a->zhi<<"     ";
  m=a->zhi;
  a->zhi=-1;
  a=a->next;
  len--;
  j=1;
  }
else if (j!=i)
{a=a->next;
  if(a->zhi!=-1)
	  j++;
}

}//for语句结尾



}