Note:Yourchoice #include"stdio.h" #include "stdlib.h" #define OK #defineERROR #defineTRUE #defineOVERFLOW -2 typedef int status; typedef int elemtype; #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef struct{ elemtype *elem; int length; int listsize; }SqList; 精品文档 statusInitList_Sq(SqList *L)/*构造一个空的顺序表*/ L->elem=(elemtype*)malloc(LIST_INIT_SIZE*sizeof(elemtype)); if(!L->elem) exit(OVERFLOW); L->length=0; L->listsize=LIST_INIT_SIZE; return OK; voidshengcheng_Sq(SqList *L)/*建立一个顺序表,含有 printf("pleaseenter some data:"); scanf("%d",&n); /*printf("请输入%d 个元素:",n);*/ 精品文档 scanf("%d",&L->elem[m]);L->length++; voidshuchu_Sq(SqList L)/*输出顺序表及顺序表的长度 printf("%d",L.elem[i]); voidMergeList_Sq(SqList *La,SqList *Lb,SqList *Lc)/*将 两个顺序有序表A elemtype*pa,*pb,*pc,*pa_last,*pb_last; pa=La->elem;pb=Lb->elem; Lc->listsize =Lc->length =La->length +Lb->length pc=Lc->elem=(elemtype *)malloc(Lc->listsize *sizeof(elemtype)); if(!Lc->elem) exit(OVERFLOW); pa_last=La->elem+La->length-1; pb_last=Lb->elem+L