include.doc单链表一.doc

#include stdio.h#include stdlib.h/* 定义ElemType为int类型 */typedef int ElemType;#define TRUE 1#define FALSE 0#define NULL 0#define flag -1/* 单链表的结点类型 */typedef struct LNodeElemType data; struct LNode *next; LNode,*LinkedList;/* 初始化单链表 */LinkedList LinkedListInit()LinkedList L; L=(LinkedList)malloc(sizeof(LNode); L-next=NULL; return L;/* 清空单链表 */void LinkedListClear(LinkedList L)L-next=NULL;/* 检查单链表是否为空 */int LinkedListEmpty(LinkedList L)if(L-next=NULL) return TRUE; else return FALSE;/* 遍历单链表 */void LinkedListTraverse(LinkedList L)LinkedList p; p=L-next; while(p!=NULL) printf(%d ,p-data); p=p-next; int LinkedListLength (LinkedList L)LinkedList p; int j; p=L-next; j=0; while(p!=NULL) j+;p=p-next; return j ;int LinkedListGet (LinkedList L, int i)LinkedList p;int j; p=L-next;j=1;while (p!=NULL & jnext; j+; if (j=i) return p-data;else return NULL;LinkedList LinkedListLocate ( LinkedList L, ElemType x)LinkedList p; p=L-next;while ( p!=NULL & p-data != x) p=p-next;return p; /* 返回查找到的元素的地址 */ void LinkedListInsert(LinkedList L, int i, ElemType x)LinkedList pre,p,s;int j; pre=L;j=1;p=L-next; while(pre&jnext;j+; if(pre=NULL) printf(给的i值超过了表长);exit(0); s=(LNode *)malloc(sizeof(LNode); s-data=x; pre-next=s; s-next=p;void LinkedListDel (LinkedList L,ElemType x) LinkedList pre,p;int j;pre=L;j=1;p=L-next;while(p&p-data!=x)pre=p;p=p-next;j+;if(p=NULL)printf(表中没有值为x的结点);exit(0);pre-next=p-next;free(p);LinkedList LinkedListCreat( ) LinkedList L=LinkedListInit(),p,r; ElemType x; r=L; printf(please input data,input -1 is endn); scanf(%d,&x); while (x!=flag)p=(LinkedList)malloc(sizeof(LNode); p-data=x; r-next=p; r=p;scanf(%d,&x); r-next=NULL; return L;int scan()int d; printf(please input the operationn); printf(1.初始化 2.清空3.求链表长度4.检查链表是否为空n); printf(5.遍历链表 6.从链表中查找元素n); printf(7.从链表中查找与给定元素值相同的元素在顺序表中的位置n); printf(8.向链表中插入元素9. 从链表中删除元素n); printf(其他键退出。n); scanf(%d,&d); return(d);void main()int quit=0;int i;ElemType e; LinkedList L; while(!quit) switch(scan() case 1:L=LinkedListInit();break; case 2:LinkedListClear(L);break; case 3:printf(the length is%dn,LinkedListLength(L);break; case 4:if(LinkedListEmpty(L)printf(truen);else printf(falsen);break; case 5:LinkedListTraverse(L);break; case 6:printf(please input the location.n);scanf(%d,&i);printf(the num.is %dn,LinkedListGet(L,i);break; case 7:printf(please input the element.n);scanf(%d,&e);printf(the location.is %dn,LinkedListLocate(L,e);break; case 8:printf(please input the insert location and insert num.n);scanf(%d%d,&i,&e);LinkedListInsert(L,i,e);break; case 9