假设以两个元素依值递增有序排列线性表A与B分别表示两个集合,现要求另辟空间构成一个顺序链表C.docVIP

#include stdio.h #include stdlib.h #define OK 1 #define ERROR 0 typedef struct { int *elem; int length; int listsize; } SqList; int InitList_Sq(SqList *L,int len) { //构造一个空的线性表L，该线性表预定义大小为len L-elem=(int *)malloc(sizeof(int)*len); if(!L-elem) return ERROR; L-length=0; L-listsize=len; return OK; } int Load_Sq(SqList *L) { // 输出顺序表中的所有元素 int i; if(L-length==0) printf(The List is empty!); else { for(i=0;iL-length;i++) printf(%d ,L-elem[i]); } printf(\n); return OK; } int Merg(SqList *LA,SqList *LB,SqList *LC) { int i,j,k; i=j=k=0; while(iLA-lengthjLB-length) { if(LA-elem[i]LB-elem[j]) { LC-elem[k]=LA-elem[i]; LC-length++; k++; i++; } else { LC-elem[k]=LB-elem[j]; LC-length++; k++; j++; } } while(iLA-length) { LC-elem[k]=LA-elem[i]; LC-length++; k++; i++; } while(jLB-length) { LC-elem[k]=LB-elem[j]; LC-length++; k++; j++; } return OK; } int Free_Sq(SqList *L) { free(L-elem); L-elem=NULL; return OK; } int main() { SqList *LA,*LB,*LC; int a_len,b_len,i; scanf(%d,a_len); LA=(SqList*)malloc(sizeof(SqList)); LB=(SqList*)malloc(sizeof(SqList)); LC=(SqList*)malloc(sizeof(SqList)); InitList_Sq(LA,a_len); for(i=0;ia_len;i++) { scanf(%d,LA-elem[i]); LA-length++; } scanf(%d,b_len); InitList_Sq(LB,b_len); for(i=0;ib_len;i++) { scanf(%d,LB-elem[i]); LB-length++; } InitList_Sq(LC,a_len+b_len); Merg(LA,LB,LC); printf(List A:); Load_Sq(LA); printf(List B:); Load_Sq(LB); printf(List C:); Load_Sq(LC); Free_Sq(LA); Free_Sq(LB); Free_Sq(LC); free(LA); free(LB); free(LC); return 0; }