circhain.cpp

来自「常用算法与数据结构原代码」· C++ 代码 · 共 36 行

#include "Circhain.h"

void main(void)
{
    CirChain<int> L;
    cout<<"Length= "<<L.Length()<<endl;
    cout<<"IsEmpty= "<<L.IsEmpty()<<endl;
    L.Insert(0,2);
    L.Insert(1,6);
    L.Insert(2,8);
    L.Insert(3,4);
    cout<<"List is "<<L<<endl;
    int z;
    L.Find(1,z);
    cout<<L.Search(8)<<endl;
    cout<<"First element is "<<z<<endl;
    CirChain<int> S=L;
    L.Delete(1,z);
    L.Append(19);
    L.Append(10);
    cout<<"Deleted element is "<<z<<endl;
    cout<<"List is "<<L<<endl;
    S.Reverse();
    S.Append(5);
    cout<<"Next list is "<<S<<endl;
    int *x;
    CirChainIterator<int> c;
    x=c.Initialize(L);
    while (x)
    {
      cout<<*x<<' ';
      x=c.Next(L);
    }
    cout<<endl;
}