循环但链表各种基本运算

 

函数：

1．Initlist(sqlist *&l):初始化循环单链表l.

2．Destroylist(sqlist *l):释放循环单链表l.

3．Listempty(sqlist *l):判断循环单链表l是否为空表.

4．Listlength(sqlist *l):返回循环单链表l的元数个数.

5．Displist(sqlist *l):输出循环单链表l.

6．Getelem(sqlist *l,int I,elemtype &e):获取循环单链表l 中第i个元数.

7．Locateelem(sqlist *l,elemtype e):在循环单链表l中查找元数e.

8．Listinsert(sqlist *&l,int I,elemtype e):在循环单链表l中第i个位置上插入元数e.

9．Listdelete(sqlist *&l,int I,elemtype &e): 循环单链表l中删除第i个元数。

 

 

 

代码实现：

#include<stdio.h>

#include<malloc.h>

typedef char elemtype;

typedef struct dnode //定义双链表结点类型

{

       elemtype data;

 

       struct dnode *next;//指向后继结点

}linklist;

 

void initlist(linklist *&l)

{

       l=(linklist * )malloc(sizeof(linklist));//创建头结点

    l->next=l;

}

 

void destroylist(linklist *&l)

{

       linklist *p=l,*q=p->next;

       while(q!=l)

       {

              free(p);

              p=q;

              q=p->next;

       }

       free(p);

}

 

int listempty(linklist *l)

{

       return(l->next==l);

}

 

int listlength(linklist *l)

{

       linklist *p=l;int i=0;

       while(p->next!=l)

       {

              i++;

              p=p->next;

       }

       return(i);

}

 

void displist(linklist *l)

{

       linklist *p=l->next;

       while(p!=l)

       {

              printf("%c",p->data);

              p=p->next;

       }

       printf("/n");

}

 

int getelem(linklist *l,int i,elemtype &e)

{

       int j=0;

       linklist *p;

       if(l->next!=l)//单链表不为空

       {

              if(i==1)

       {e=l->next->data;

       return 1;

       }

       else//i不为1时

       {

              p=l->next;

              while(j<i-1&&p!=l)

              {

                     j++;

                     p=p->next;

              }

              if(p==l)

                     return 0;

              else

              {

                     e=p->data;

                     return 1;

              }

       }

       }

       else//单链表为空时

              return 0;

}

 

int locateelem(linklist *l,elemtype e)

{

       int n=1;

       linklist *p=l->next;

       while(p!=l&&p->data!=e)

       {

             

              p=p->next;

              n++;

       }

       if(p==l)

              return(0);

       else

              return(n);

}

 

int listinsert(linklist *&l,int i,elemtype e)

{

       int j=0;

       linklist *p=l,*s;

    if(p->next==l||i==1)//原表为空或i==1时

       {

              s=(linklist * )malloc(sizeof(linklist));//创建新结点*s

              s->data=e;

              s->next=p->next;//将*s插到*p之后

              p->next=s;

              return 1;

       }

       else

       {p=l->next;

       while(j<i-2&&p!=l)

       {

              j++;

              p=p->next;

       }

       if(p==l)//未找到第i-1个结点

              return 0;

       else//找到第i-1个结点

       {s=(linklist * )malloc(sizeof(linklist));//创建新结点*s

              s->data=e;

              s->next=p->next;//将*s插到*p之后

              p->next=s;

              return 1;

       }

       }

}

 

 

int listdelete(linklist *&l,int i,elemtype &e)

{

       int j=0;

       linklist *p=l,*q;

    if(p->next!=l)//原单链表不为空时

       {if(i==1)//i==1时

       {

              q=l->next;//删除第1个结点

              l->next=q->next;

              free(q);

              return 1;

       }

       else

       {

              p=l->next;

              while(j<i-2&&p!=l)

              {

                     j++;

                     p=p->next;

              }

              if(p==l)//未找到第i-1个结点

                     return 0;

              else

              {

                     q=p->next;//q指向要删除的结点

                     p->next=q->next;//从单链表中删除*q结点

                     free(q);//释放*q结点

                     return 1;

              }

       }

       }

       else return 0;

}

 

void main()

{

       linklist *h;

       elemtype e;

       printf("(1)初始化循环单链表h/n");

       initlist(h);

       printf("(2)依次才用尾插法插入a,b,c,d,e元素/n");

       listinsert(h,1,'a');

       listinsert(h,2,'b');

       listinsert(h,3,'c');

       listinsert(h,4,'d');

       listinsert(h,5,'e');

       printf("(3)输出循环单链表h:");

       displist(h);

       printf("(4)循环单链表h长度=%d/n",listlength(h));

       printf("(5)循环单链表h为%s/n",(listempty(h)?"空":"非空"));

       getelem(h,3,e);

       printf("(6)循环单链表h的第3个元素=%c/n",e);

    printf("(7)元素a的位置=%d/n",locateelem(h,'a'));

       printf("(8)在第4个元素位置上插入f元素/n");

       listinsert(h,4,'f');

       printf("(9)输出循环单链表h:");

       displist(h);

       printf("(10)删除h的第3个元素/n");

       listdelete(h,3,e);

       printf("(11)输出循环单链表h:");

       displist(h);

    printf("(12)释放循环单链表h/n");

       destroylist(h);

}