关于链表的程序.docVIP

?以下程序是实现链表基本功能的，包括插入结点、删除结点值、求表长和打印个结点值等功能，也就是将书上的算法组合了一下，程序运行没问题，不要见笑哦！ #include stdio.h#include stdlib.htypedef int datatype;typedef struct link_node{? datatype info;? struct link_node *next;}node;node *init(){ ? node *head;? head=(node*)malloc(sizeof(node));? head-next=NULL;? return head;}void? display(node *head){ ? node *p;? p=head-next;? if(!p)???? printf(The listlink is empty!\n);? else??? { ?? printf(The numbers are the following:\n);????? while(p)????? { ????? printf(%d? ,p-info);???????? p=p-next;????? }???? //* printf(\n);??? }}node *find(node *head,int i){ ? int j=0;? node *p=head;? if(i0)? ??? {???? printf(No element!\n);???? return NULL;??? }? while(pi!=j)? { ??? p=p-next;??? j++;? }? return p;}node *insert(node *head,datatype x,int i){ node *p,*q;? q=find(head,i);? if(!q)?? {??? printf(No number %d node,%d cant be inserted\n,i,x);??? return NULL;?? }? ??? p=(node*)malloc(sizeof(node));??? p-info=x;??? ??? p-next=q-next;??? q-next=p;??? return head;}int listlen(node *head){ node *p=head;? int i=-1;? while(p!=NULL)? { i++;??? p=p-next;? }? return i;}node *dele(node *head,datatype x){ int i=-1;? node *pre=head,*q;? q=head-next;? while(qq-info!=x)? { ??? pre=q;??? q=q-next;??? i++;? }? pre-next=q-next; ??? free(q);? ??? ? return head;? } main(){? ?? node *a,*p,*q;?? int i,pos,len;?? datatype x;?? char c;?? printf(A: Insert x after number pos node!\n);?? printf(B: Delect x in the link_list!\n);?? printf(C: Return the length of the list_link!\n);?? printf(D: Find the number i nodes element!\n);?? printf(E: End the program!\n); ?? printf(F: Display the element of each node!\n\n); ???? ???? a=init();? printf(Please input c:\n);? while(scanf(%c,c)!=EOF)? {? ??? if(c==E) break;??? switch(c)??? { case A: printf(Input x and pos:\n);??????????????? scanf(%d%d,x,pos);??????????????? insert(a,x,pos);??????????????? printf(Input c again:\n);??????????????? brea