有两张单调递增有序的线性表A和B,采用顺序存储结构,将这两张表合并成C表,要求C表单调递减有序

1、/* Note:Your choice is C IDE */#i nclude "stdio.h"#i nclude "stdlib.h"#defi ne OK 1#defi ne ERROR 0#defi ne TRUE 1#defi ne OVERFLOW -2typedef int status;typedef int elemtype;#defi ne LIST_INIT_SIZE 100#defi ne LISTINCREMENT 10typedef structelemtype *elem;int len gth;int listsize;

2、SqList;status InitList_Sq(SqList *L)/构造一个空的顺序表 */L->elem=(elemtype*)malloc(LIST_INIT_SIZE*sizeof(elemtype);if(!L->elem) exit(OVERFLOW);L->le ngth=O;L->listsize=LIST_INIT_SIZE;return OK;void she ngche ng_Sq(SqList *L)/建 立一个顺序表，含有n个数据元素。*/int m,n;prin tf("please en ter some data:"

3、;);sca nf("%d",&n);/*printf("请输入 %d 个元素：",n);*/for(m=0 ;m<n; m+)sea nf("%d",&L->elemm);L->le ngth+;void shuchu_Sq(SqList L)/输出顺序表及顺序表的长度*/int i;/*pri ntf("顺序表中的元素是：n");*/for(i=0;i< Len gth;i+)prin tf("%d", L.elemi);prin tf("n

4、");void MergeList_Sq(SqList*La,SqList *Lb,SqList *Lc)/* 将两个顺序有序表A和B合并为一个有序表Co */elemtype *pa,*pb,*pc,*pa_last,*pb_last;pa=La->elem;pb=Lb->elem;Lc->listsize =Lc->le ngth =La->le ngth +Lb->le ngth ;pc=Lc->elem =(elemtype *)malloc(Lc->listsize *sizeof(elemtype);if(!Lc->e

5、lem) exit(OVERFLOW);pa_last=La->elem+La->le ngth-1;pb_last=Lb->elem+Lb->le ngth-1;while(pa<=pa_last && pb<=pb_last)if(*pa<=*pb) *pc+=*pa+;else *pc+=*pb+;while(pa<=pa_last) *pc+=*pa+;while(pb<=paast) *pc+=*pb+;void nizhi_Sq(SqList *La,SqList *Lb)/将顺序表逆置，将结果保存到另外的顺序表

6、中。*/int m,p;In itList_Sq(Lb);p=La->le ngth-1;for(m=0;mv=p;m+)Lb->elemm=La->elemp-m;Lb->le ngth+;void main()SqList La,Lb,Lc,Ld;In itList_Sq(&La);In itList_Sq(&Lb);In itList_Sq(&Lc);In itList_Sq(&Ld); she ngche ng_Sq(&La); shuchu_Sq(La);she ngche ng_Sq(&Lb); shuchu_Sq(Lb)