单链表操作程序分析.ppt

1、单链表操作,程序分析,1.首部说明部分,/* = link_list operater = */ #include stdio.h; #define NULL 0 #define ERROR 0 #define OK 1 #define LEN sizeof(struct LNode) typedef struct LNode int data; struct LNode *next; *LinkList;,2.函数说明部分,creat_Linklist(LinkList *L); int LocatElem_L(LinkList L, int e); int ListLength_L(Lin

2、kList L); void print(LinkList head); Insert_Linklist(LinkList *L, int i, int e); Delete_Linklist(LinkList *L, int i, int *e); char menu(void);,3.主函数模块,main() LinkList head=NULL; int i,x,n,flag=1,k; char ch; do ch=menu(); clrscr(); switch (ch) case 1: printf(Input numbers to creat list(end by=0):); c

3、reat_Linklist(,case 2: printf(input location to insert before. i=); scanf(%d,case 5: printf(input a number to locate. x=); scanf(%d, ,4.0 菜单模块,char menu(void) char ch; clrscr(); printf(nn); printf( MENU n); /*puts()*/ printf( =n); printf( Link-list operationn); printf( 1. creatn); printf( 2. insertn

4、); printf( 3. deleten); printf( 4. print n);,printf( 5. getelementn); printf( 6. length n); printf( 0. exit n); printf( =n); printf( Choice(0,1,2,3,4,5,6):); ch=getchar(); return(ch); ,4.1 建立链表模块,creat_Linklist(LinkList *L) LinkList p, q; int x; p=(LinkList)malloc(LEN); *L=p; /*建立头结点，由*L指向*/ scanf(%

5、d, ,4.2 元素定位模块,int LocatElem_L(LinkList L, int e) LinkList p; int i; p=L-next; i=1; while (p!=NULL) ,4.3 求链表长度模块,int ListLength_L(LinkList L) LinkList p; int n; n=0; p=L-next; while(p!=NULL) n=n+1; p=p-next; return(n); ,4.4 输出链表模块,void print(LinkList head) LinkList p; p=head-next; while(p!=NULL) printf(%5d,p-data); p=p-next; printf(n); getch(); ,4.5 插入模块,Insert_Linklist(LinkList *L, int i, int e) LinkList head,p,s; int j; head=*L; j=0; p=head; /* 指针初始化，j为计数器*/ while (p-next!=NULL) ,4.6 删除模块,De