循环链表C++实现

#include <iostream>
using namespace std;
typedef int ElemType;
struct NodeType
{
ElemType data;
NodeType *next;
};
class Circlist
{
private:
NodeType *Head;
int len;
public:
Circlist();  //默认构造函数
~Circlist();
void createListForword();//头插法
void createBackward();  //尾插法
bool isEmptyList();//判断链表是否为空
void Print();
int Locate(ElemType e);
void insertFirst(ElemType e);
void insertLast(ElemType e);
void insertBefore(int i,ElemType x);
void insertAfter(int i,ElemType x);
void delet(int i);
};
 Circlist::Circlist()//初始化，建立一个空循环链表
{
     Head=new NodeType;
Head->next=Head;
len=0;
}
 Circlist::~Circlist()
 {
NodeType *p;
if(Head!=NULL)//判断头是不是为空，为空表示已经释放
{
p=Head->next;
while(p!=Head)
{
Head->next=p->next;
delete p;
p=Head->next;
}
delete p;
cout<<"\n  链表已经删除。"<<endl;
Head=NULL;
}
 }
void Circlist::createListForword(){
NodeType *s;
cout<<"输入该循环链表长度："<<endl;
cin>>len;
for (int i=0;i<len;i++)
{
s=new NodeType;
cout<<"输入元素（倒序）："<<endl;
cin>>s->data;
s->next=Head->next;
Head->next=s;//每插入一个结点，都是要把它放在第一个结点的。
}
}
void Circlist::createBackward()//尾插法
{
NodeType *q,*s;
q=Head;
cout<<"输入链表的长度："<<endl;
cin>>len;
for(int i=0;i<len;i++)
{
s=new NodeType;
cout<<"输入元素（正序）："<<endl;
cin>>s->data;
s->next=q->next;
q->next=s;
q=q->next;
}
}
bool Circlist::isEmptyList()
{
if(Head->next==Head)
{
return true;
}else{return false;}
}
void Circlist::Print()
{
NodeType *p=Head->next;
while(p!=Head)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<endl;
}
int Circlist::Locate(ElemType e)
{
NodeType *p;
int i=1;
if (isEmptyList())
{
cout<<"List is Empty"<<endl;
}else{
p=Head->next;//指向第一个元素
while (p!=Head&&p->data!=e)
{
p=p->next;
i++;
}
if (i<len)
{
return i+1;
}else{
cout<<"没有在链表中找到元素"<<e<<endl;
}
}
}


void Circlist::insertFirst(ElemType e){
NodeType *s=new NodeType;
s->data=e;
s->next=Head->next;
Head->next=s;
len++;
}
void Circlist::insertLast(ElemType e){
NodeType *s=new NodeType;
s->data=e;
//寻找位置
NodeType *q=Head;
while (q->next!=Head)
{
q=q->next;
}
//此时q的结点指向最后一个结点
s->next=q->next;
q->next=s;
len++;
}
void Circlist::insertBefore(int i,ElemType x)//在第i个位置前插入数据x
{
int j=1;
NodeType *q=Head;
if(i<1||i>len)
{
cout<<"插入的位置不正确"<<endl;
return;
}
NodeType *s=new NodeType;
s->data=x;
while (j<i)
{
q=q->next;
j++;
}
s->next=q->next;
q->next=s;
len++;
}
void Circlist::insertAfter(int i,ElemType x)//在第i个位置后插入数据x
{
int j=1;
if(i<1||i>len){
cout<<"插入的位置不正确"<<endl;
return;
}
NodeType *s=new NodeType;
NodeType *p=Head->next;
s->data=x;
while (j<i)
{
p=p->next;
j++;
}
s->next=p->next;
p->next=s;
len++;
}
void Circlist::delet(int i)//删除第i个位置上的元素
{
if (i<1||i>len)
{
cout<<"删除的位置不合理"<<endl;
return;
}
NodeType *p=Head->next;
NodeType *q=Head;
int j=1;
while (j<i)
{
q=p;
p=p->next;
j++;
}
q->next=p->next;
delete p;
}