seCList();
cout<<"插入后双向循环链表q:\n";
it=101;q.InsertCLfront(it,5);
q.TraverseCList();
cout<<"插入后双向循环链表q:\n";
it=102;q.InsertCLfront(it,13);
q.TraverseCList();
cout<<"插入后q表长:"< cout<<"第1个数:"< cout<<"删除后q表长:"< q.TraverseCList();
cout<<"第5个数:"< cout<<"删除后q表长:"< q.TraverseCList();
cout<<"第11个数:"< cout<<"删除后q表长:"< q.TraverseCList();
cout<<"删除的数为:"< cout<<"删除后q表长:"< q.TraverseCList();
cout<<"求解约瑟夫(Josephus)问题\n";
cout<<"输入人数n:";cin>>n;
cout<<"输入第次数m:";cin>>m;
for(i=0;i cout<<"员工编号依次为:";
DuLNode *w=mylink.Reset();
while(!mylink.EndOCList())
{cout<data;
w=mylink.Next();}
cout< cout<<"删除次序依次为:\n";
mylink.Reset(-1);
for(i=0;i {for(int j=0;j {w=mylink.Next();
if(mylink.EndOCList()) w=mylink.Next();}
if(mylink.EndCList()) w=mylink.Next();
cout<<"删除第"< cout<<"最后剩下的是:第"< cin.get();cin.get();
}
效果如下
|