2.2 将两个线性表合并成一个线性表，允许连表中有重复

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

typedef int Status ;
typedef int ElemType;
#define OK 1
#define ERROR 0

#define LISTSIZE 10
#define ADDSIZE 2
typedef struct
{
    ElemType *elem;
    int length;
    int listsize;
}SqList;

Status InitList(SqList *L)
{
    (*L).elem=malloc(LISTSIZE*sizeof(ElemType));
    if(!(*L).elem)
        exit(OVERFLOW);
    (*L).length=0;
    (*L).listsize=LISTSIZE;
    return OK;
}
Status GetElem(SqList L,int i,ElemType *e)
{
    if(i<1||i>L.length)
        return ERROR;
    *e=*(L.elem+i-1);
    return OK;
}
Status ListInsert(SqList *L,int i,ElemType e)
{
    ElemType *newbase,*p,*q;
    if(i<1||i>(*L).length+1)
        return ERROR;
    if((*L).length>=(*L).listsize)
    {
        newbase=(ElemType*)realloc((*L).elem,((*L).length+ADDSIZE)*sizeof(ElemType));
        if(!newbase)
            exit(OVERFLOW);
        (*L).elem=newbase;
        (*L).listsize+=ADDSIZE;
    }
    p=(*L).elem+i-1;
    q=(*L).elem+(*L).length-1;
    while(p<=q)
    {
        *(q+1)=*q;
        --q;
    }
    *p=e;
    ++(*L).length;
    return OK;
}
int ListLength(SqList L)
{
    return L.length;
}
Status LocateElem(SqList L,ElemType e,Status (*compare)(ElemType ,ElemType))
{
    int i=1;
    ElemType *p,*q;
    p=L.elem;
    q=L.elem+L.length-1;
    while(p<=q&&!compare(*p,e))
    {
        ++p;
        ++i;
    }
    if(i<=L.length)
        return i;
    else
        return 0;
}
Status ListTraverse(SqList L,void(*visit)(ElemType))
{
    ElemType *p=L.elem;
    int i=1;
    while(i<=L.length)
    {
        visit(*p);
        ++p;
        ++i;
    }
    printf("\n");
    return OK;
}
Status equal(ElemType c1,ElemType c2)
{
    if(c1==c2)
        return 1;
    else
        return 0;
}
void MergeList(SqList La,SqList Lb,SqList *Lc)
{
    int i=1,j=1,k=0;
    int La_len,Lb_len;
    ElemType ai,bj;
    InitList(Lc);
    La_len=ListLength(La);
    Lb_len=ListLength(Lb);
    while(i<=La_len&&j<=Lb_len)
    {
        GetElem(La,i,&ai);
        GetElem(Lb,j,&bj);
        if(ai<=bj)
        {
            ListInsert(Lc,++k,ai);
            ++i;
        }
        else
        {
            ListInsert(Lc,++k,bj);
            ++j;
        }
    }
    while(i<=La_len)
    {
        GetElem(La,i++,&ai);
        ListInsert(Lc,++k,ai);
    }
    while(j<=Lb_len)
    {
        GetElem(Lb,j++,&bj);
        ListInsert(Lc,++k,bj);
    }
}
void print(ElemType c)
{
    printf("%d ",c);
}

void main()
{
    SqList La,Lb,Lc;
    int j,a[4]={3,5,8,11},b[7]={2,6,8,9,11,15,20};
    InitList(&La);
    for(j=1;j<=4;j++)
        ListInsert(&La,j,a[j-1]);
    printf("La=");
    ListTraverse(La,print);
    InitList(&Lb);
    for(j=1;j<=7;j++)
        ListInsert(&Lb,j,b[j-1]);
    printf("Lb=");
    ListTraverse(Lb,print);
    MergeList(La,Lb,&Lc);
    printf("Lc=");
    ListTraverse(Lc,print);
}

程序运行结果如下