数据结构实现循环链表

头文件“2_3_2.h”

# include<malloc.h># include<stdlib.h># include<iostream.h>typedef struct LNode{int data;struct LNode *next;}*LinkList;void CreateList(LinkList &L,int n){ //操作一//逆位序输入n个元素的值，建立带表头结点的循环单链线性表LL=(LinkList)malloc(sizeof(LNode));LinkList p;L->next=L; for(int i=n;i>0;--i){p=(LinkList)malloc(sizeof(LNode)); //生成新结点cin>>p->data;p->next=L->next;L->next=p;}}void InitList(LinkList &L){//初始化操作L=(LinkList)malloc(sizeof(LNode)); //生成头结点L->next=L;}void DestroyList(LinkList &L){//销毁操作LinkList p=L,q=L->next;while(q!=L){free(p);p=q;q=p->next;}free(p);p=NULL;L=NULL;}void ClearList(LinkList &L){//置空操作LinkList p=L->next,q=p->next;while(q!=L){free(p);p=q;q=p->next;}free(p);p=NULL;L->next=L;}int ListEmpty(LinkList L){ //操作二//判空操作if(L->next!=L)return 0;return 1;}int ListLength(LinkList L){ //操作二//求长度操作LinkList p=L;int i=0;while(p->next!=L){i++;p=p->next;}return i;}void GetElem(LinkList L,int i,int &e){ //操作三//获取第i个元素的值，赋给eif(i<1||i>ListLength(L))cout<<"有误"<<endl;else{LinkList p=L->next;int j=1;while(p!=L&&j<i){p=p->next;j++;}e=p->data; //获取第i个元素的值}}int compare(int e1,int e2){if(e1==e2)return 1;return 0;}int LocateElem(LinkList L,int e,int(*compare)(int,int)){ //操作五//遍历操作，返回线性表中值为e的位序，否则返回0int i=0;LinkList p=L->next;while(p!=L){i++;if(compare(e,p->data))return i;p=p->next;}return 0;}void PriorElem(LinkList L,int cur_e,int &pre_e){ //操作四//求前驱结点LinkList p=L,q=L->next;if(q->data==cur_e)cout<<"第1个元素元前驱"<<endl;else{while(q!=L){if(q->data==cur_e){pre_e=p->data;return;}p=p->next;q=q->next;}if(q==L)cout<<"不存在该元素"<<endl;}}void NextElem(LinkList L,int cur_e,int &next_e){ //操作六//求后继结点LinkList p=L->next;while(p!=L){if(p->data==cur_e){if(p->next==L){cout<<"最后一个结点没有后继"<<endl;break;}next_e=p->next->data;break;}p=p->next;if(p==L)cout<<"不存在该元素"<<endl;}}void ListInsert(LinkList &L,int i,int e){ //操作七//插入操作if(i<1||i>ListLength(L)+1)cout<<"有误"<<endl;else{LinkList p=L,s;int j=1;while(j<i){p=p->next;j++;}s=(LinkList)malloc(sizeof(LNode)); //生成结点s->data=e;s->next=p->next;p->next=s;}}void ListDelete(LinkList &L,int i,int &e){ //操作八//删除操作if(i<1||i>ListLength(L))cout<<"有误"<<endl;else{LinkList p=L;int j=1;while(j<i){j++;p=p->next;}LinkList q=p->next;e=q->data;p->next=q->next;free(q);q=NULL;}}void visit(int e){cout<<e<<" ";}void ListTraverse(LinkList L,void(*visit)(int)){//遍历线性表LinkList p=L->next;while(p!=L){visit(p->data);p=p->next;}}

主文件“test.cpp”

# include"2_3_2.h"void main(){cout<<"#########测试操作一######"<<endl;LinkList L; CreateList(L,3);ListTraverse(L,visit);cout<<"/n#########测试操作二######"<<endl;cout<<ListEmpty(L)<<endl;cout<<ListLength(L)<<endl;ClearList(L);cout<<ListEmpty(L)<<endl;cout<<ListLength(L)<<endl;DestroyList(L);cout<<"/n#########测试操作三######"<<endl;LinkList L1;int e; CreateList(L1,3);GetElem(L1,0,e);GetElem(L1,1,e);cout<<e<<endl;GetElem(L1,2,e);cout<<e<<endl;GetElem(L1,3,e);cout<<e<<endl;GetElem(L1,4,e);cout<<"/n#########测试操作四######"<<endl;int pre_e;PriorElem(L1,0,pre_e);PriorElem(L1,1,pre_e);PriorElem(L1,2,pre_e);cout<<pre_e<<endl;PriorElem(L1,3,pre_e);cout<<pre_e<<endl;PriorElem(L1,4,pre_e); cout<<"/n#########测试操作五######"<<endl;cout<<LocateElem(L1,0,compare)<<endl;cout<<LocateElem(L1,1,compare)<<endl;cout<<LocateElem(L1,2,compare)<<endl;cout<<LocateElem(L1,3,compare)<<endl;cout<<LocateElem(L1,4,compare)<<endl; cout<<"/n#########测试操作六######"<<endl;int next_e; NextElem(L1,0,next_e);NextElem(L1,1,next_e);cout<<next_e<<endl;NextElem(L1,2,next_e);cout<<next_e<<endl;NextElem(L1,3,next_e);NextElem(L1,4,next_e); cout<<"/n#########测试操作七######"<<endl;ListInsert(L1,0,1);ListInsert(L1,5,1);ListInsert(L1,1,0);ListInsert(L1,5,4);ListInsert(L1,6,5); ListTraverse(L1,visit);cout<<endl;cout<<"/n#########测试操作八######"<<endl; ListDelete(L1,0,e);ListDelete(L1,7,e);ListDelete(L1,1,e);cout<<e<<endl;ListDelete(L1,5,e);cout<<e<<endl; ListTraverse(L1,visit);cout<<endl;}

输出结果：