数据结构单链表基本操作代码

1、实验一单链表#i nclude "stdio.h"#i nclude "stdlib.h" typ edef int ElemT ype;typ edef struct LNodeElemT ype data; struct LNode *n ext;LNode,*Li nkList;void creatLNode(L in kList &head)int i,n;LNode *p;head=(LNode*)malloc(sizeof(LNode); head-> next=NULL;printf("请输入链表的元素个数：&quo

2、t;); sca nf("%d",&n);for(i=n;i>0;i-)p=(LNode*)malloc(sizeof(LNode); printf("第 %d 个元素：",i);scan f("%d",&p->data);p->n ext=head->n ext; head->n ext=p;void In sertLNode(Li nkList &L)LNode *p=L;int i,j=0,e;printf("请输入你要插入的位置(超过链表长度的默认插在最后！):&

3、quot;);sca nf("%d",&i);printf("请输入你要插入的元素：");sca nf("%d",&e);while (p->n ext&&jvi-1)p=p->n ext;+j;LNode *s; s=(LNode*)malloc(sizeof(LNode); s->data=e;s->n ext=p->n ext;p->n ext=s; int DeleteLNode(Li nkList & L,i nt i,i nt &e) LN

4、ode *p;p=L;LNode *q;int j=0;while (p->n ext&&jvi-1)p=p->n ext;+j;if(!( p-> next)|j>i-1)printf("删除位置不合理！n"); return 0;q=p->n ext; p->n ext=q->n ext; e=q->data; free(q);return e;void DeleteCF(Li nkList &L) LNode *p ,*s,*r;p=L->n ext; while( p!=NULL)r=p;

5、s=r->n ext; while(s!=NULL)if(p->data=s->data) r->n ext=s->n ext; s=s->n ext;elser=r- >n ext; s=s->n ext; p=p->n ext;void dis play(L in kList &L)LNode *p;p=L->n ext;while( p!=NULL) prin tf("%d",p->data);p=p->n ext;prin tf("n");void mai n()pr

6、intf("线性链表的基本操作！!n");Lin kList L;creatLNode(L);printf("初始链表为：");dis play(L);In sertLNode(L);printf("插入元素后的链表为：");dis play(L);int e=0;e=DeleteLNode(L,2,e);删除链表中的第二个元素printf("删除元素后的链表为：");dis play(L);printf("你删除的元素为：dn",e);prin tf("nnn");printf("单链表重复元素的删除！!n"); Lin kList L1;creatLNode(LI)