线性表的合并操作链式存储/* Note:Your choice is C IDE */#include stdio.h#include stdlib.h#define ERROR 0#define OK 1typedef int Status;typedef int ElemType;typedef struct LNodeElemType data;struct LNode *next;LNode,*LinkList;/初始化Status InitList_L(LinkList *L)*L=(LinkList)malloc(sizeof(LNode);if(!*L)exit(0);(*L)-next=NULL;return OK; /测长度int ListLength_L(LinkList L)LinkList p;int j;p=L-next;j=0;while(p)p=p-next;j+;return j;/插入操作Status ListInsert_L(LinkList L,int i,ElemType e)LinkList p,s;int j;p=L;j=0;while(p&jnext;j+;if(!p|ji-1) return ERROR;s=(LinkList)malloc(sizeof(LNode);if(!s)exit(0);s-data=e;s-next=p-next;p-next=s;return OK;/删除操作Status ListDelete_L(LinkList L,int i,ElemType *e)LinkList p,q;int j;p=L;j=0;while(!p&jnext;j+;if(!(p-next)|ji-1) return ERROR;q=p-next;*e=q-data;p-next=q-next;free(q);return OK;/合并操作void MergeList_L(LinkList La,LinkList Lb,LinkList *Lc)LinkList pa,pb,pc;pa=La-next;pb=Lb-next;*Lc=pc=La;while(pa&pb)if(pa-datadata) pc-next=pa;pc=pa;pa=pa-next;else pc-next=pb;pc=pb;pb=pb-next;pc-next=pa?pa:pb;free(Lb);void main() LinkList La,Lb,Lc,q; ElemType e; int i,j,a,b; if(InitList_L(&La) printf(La:Initer is OK!n); else printf(error!n); /La的赋值 printf(please input La.length!n); scanf(%d,&a); printf(Please input the Las values of sq:n); for(i=0;inext;j=i;j+) if(edata)break; else q=q-next; if(!ListInsert_L(La,j,e)printf(error!n); printf(La-); q=La-next; while(q) if(q-next)printf(%d-,q-data); else printf(%dn,q-data); q=q-next; printf(Las length: %dnn,ListLength_L(La); /Lb的赋值 if(InitList_L(&Lb) printf(Lb:Initer is OK!n); printf(please input Lb.length!n);scanf(%d,&b);printf(Please input the Lbs values of sq:n); for(i=0;inext;j=i;j+) if(edata)break; else q=q-next; if(!ListInsert_L(Lb,j,e)printf(error!n); printf(Lb-); q=Lb-next; while(q) if(q-next)printf(%d-,q-data); else printf(%dn,q-data); q=q-next; printf(Lbs length: %dnn,ListLength_L(Lb); /Lc=La+Lb的运算 MergeList_L(La,Lb,&Lc); printf(Lc-); q=Lc-next; while(q) if(q-next)printf(%d-,q-data); else printf(%dn,q-data); q=q-next; printf(Lcs length: %dnn,ListLength_L(Lc);