链表的建立、插入和删除（2）
点击次数：22 次 发布日期：2008-12-01 12:00:07 作者：源代码网
|
} e l s e { /*插入位置在表中* / p 3 - > n e x t = p 1 ; p 1 - > n e x t = p 2 ; } e l s e { /*插入位置在表尾* / p 2 - > n e x t = p 1 ; p 1 - > n e x t = N U L L ; } } r e t u r n ( h e a d ) ; / * 返回链表的头指针* / } 3. 实例[例7 - 7 ] 创建包含学号、姓名节点的单链表。其节点数任意个，表以学号为序，低学号的在前，高学号的在后，以输入姓名为空作结束。在此链表中，要求删除一个给定姓名的节点，并插入一个给定学号和姓名的节点。 # include "slib.h" # include "malloc. h" suct node /*节点的数据结构* / { int num; char s[20]; suct node *next; } ; / * * * * * * * * * * * * * * * * * * * * * * * * * * * * / main( ) { / *函数声明* / suct node *creat(); suct node *insert(); suct node *delet(); void print( ); suct node *head; char s[20]; int n; head=NULL; /*做空表* / head=creat (head); / *调用函数创建以head 为头的链表* / p r i n t ( h e a d ) ；/ *调用函数输出节点* / printf("\n input inserted num,name:\n"); gets(s); /*输入学号* / n=atoi (s); gets(s); /*输入姓名* / head=insert (head, s, n); 将/*节点插入链表*/ print (head)； / *调用函数输出节点*/ printf("\n input deleted name:\n"); gets(s); /*输入被删姓名* / head=delet(head,s); /调*用函数删除节点*/ print (head); /*调用函数输出节点* / r e t u r n ; } / * * * * * * * * * * * * * * * * * * * * * * / / * * * 创建链表* * * * * * * * * * * * / suct node *creat(suct node *head) { char temp[30]; suct node *pl,*p2; pl=p2=(suct node*) malloc(sizeof(suct node)); printf ("input num, name: \n;") printf("exit:double times Enter!\n"); g e t s ( t e m p ) ; gets (p1->s); pl->num=atoi (temp); p l - > n e x t = N U L L ; while (slen (pl->s)>0 { if (head==NULL) head=pl； else p2->next=p1; P 2 = p l ； pl=(suct node *)malloc(sizeof(suct node)); printf ("input num, name: \n"); printf("exit:double times Enter!\n"); g e t s ( t e m p ) ; gets(pl ->s); p1->num=atoi (temp); P 1 - > n e x t = N U L L ; } return head; } / * * * * * * * * * * * * * * * * * * * * / / * * * * * * * * * * 插入节点* * * * * * * * * * / suct node *insert (head, ps,n); suct node *head; char *ps; int n; { suct node *pl,*p2,*p3; p1=(suct node*)malloc(sizeof(suct node)); scpy (p1->s, ps); p 1 - > n u m = n ; p 2 = h e a d ; i f ( h e a d = = N U L L ) { h e a d = p l ; p l - > n e x t = N U L L ; } e l s e { while (n>p2->num&&p2->next!=NULL) { p 3 = P 2 p 2 = p 2 - > n e x t ; } if (n<=p2->num) if (head==p2) { h e a d = p l ; p l - > n e x t = p 2 ; } else { p 3 - > n e x t = p l ; p l - > n e x t = p 2 ; } else { p 2 - > n e x t = p l ; p l - > n e x t = N U L L ; } } r e t u r n ( h e a d ) ; } / * * * * * * * * * * * * * * * * * * * * * * * * * / / * * * * * 删除节点* * * * * * * * * * * * * / suct node *delet (head, ps) suct node *head; char *ps; { suct node *temp,*p; t e m p = h e a d ; if (head==NULL) printf("\nList is null!\n"); else { t e m p = h e a d ; while (scmp(temp->s,ps)!=O&&temp->next!=NULL) { p = t e m p ; t e m p = t e m p - > n e x t , } i f ( s t r c m p ( t e m p - > s t r , p s t r ) = = 0 ) { if (temp== head) { h e a d = h e a d - > n e x t ; f r e e ( t e m p ) ; } else { p->next =temp->next; printf("delete sing :%s\n",temp->s); f r e e ( t e m p ) ; } } else printf("\nno find sing!\n"); } return(head); } / * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * / / * * * * * * * * * * 链表各节点的输出* * * * * * * * * * / void print (suct node *head) { suct node *temp; t e m p = h e a d ; printf("\n output sings:\n"); while (temp!=NULL) { p r i n t f ( " \ n % d - - - - % s \ n " , t e m p - > n u m ，t e m p - > s t r ) ； t e m p = t e m p - > n e x t ； } r e t u r n ; }  } } r e t u r n ( h e a d ) ; } / * * * * * * * * * * * * * * * * * * * * * * * * * / / * * * * * 删除节点* * * * * * * * * * * * * / suct node *delet (head, ps) suct node *head; char *ps; { suct node *temp,*p; t e m p = h e a d ; if (head==NULL) printf("\nList is null!\n"); else { t e m p = h e a d ; while (scmp(temp->s,ps)!=O&&temp->next!=NULL) { p = t e m p ; t e m p = t e m p - > n e x t , } i f ( s t r c m p ( t e m p - > s t r , p s t r ) = = 0 ) { if (temp== head) { h e a d = h e a d - > n e x t ; f r e e ( t e m p ) ; } else { p->next =temp->next; printf("delete sing :%s\n",temp->s); f r e e ( t e m p ) ; } } 源代码网供稿. |
