第三周-求集合并集

#ifndef LIST_H_INCLUDED  
#define LIST_H_INCLUDED  
  
#define MaxSize 50  
typedef int ElemType;  
typedef struct  
{  
    ElemType data[MaxSize];  
    int length;  
} SqList;  
void CreateList(SqList *&L, ElemType a[], int n);//用数组创建线性表  
void InitList(SqList *&L);//初始化线性表InitList(L)  
void DestroyList(SqList *&L);//销毁线性表DestroyList(L)  
bool ListEmpty(SqList *L);//判定是否为空表ListEmpty(L)  
int ListLength(SqList *L);//求线性表的长度ListLength(L)  
void DispList(SqList *L);//输出线性表DispList(L)  
bool GetElem(SqList *L,int i,ElemType &e);//求某个数据元素值GetElem(L,i,e)  
int LocateElem(SqList *L, ElemType e);//按元素值查找LocateElem(L,e)  
bool ListInsert(SqList *&L,int i,ElemType e);//插入数据元素ListInsert(L,i,e)  
bool ListDelete(SqList *&L,int i,ElemType &e);//删除数据元素ListDelete(L,i,e)#endif // LIST_H_INCLUDED  
 

#include "list.h"//求合集  
void unionList(SqList *LA, SqList *LB, SqList *&LC)  
{  
    int lena,i;  
    ElemType e;  
    InitList(LC);  
    for (i=1; i<=ListLength(LA); i++) //将LA的所有元素插入到Lc中  
    {  
        GetElem(LA,i,e);  
        ListInsert(LC,i,e);  
    }  
    lena=ListLength(LA);         //求线性表LA的长度  
    for (i=1; i<=ListLength(LB); i++)  
    {  
        GetElem(LB,i,e);         //取LB中第i个数据元素赋给e  
        if (!LocateElem(LA,e)) //LA中不存在和e相同者,插入到LC中  
            ListInsert(LC,++lena,e);  
    }  
}  
//以下为算法库功能函数  
//用数组创建线性表  
void CreateList(SqList *&L, ElemType a[], int n)  
{  
    int i;  
    L=(SqList *)malloc(sizeof(SqList));  
    for (i=0; i<n; i++)  
        L->data[i]=a[i];  
    L->length=n;  
}  
//初始化线性表InitList(L)  
void InitList(SqList *&L)   //引用型指针  
{  
    L=(SqList *)malloc(sizeof(SqList));  
    //分配存放线性表的空间  
    L->length=0;  
}  
//销毁线性表DestroyList(L)  
void DestroyList(SqList *&L)  
{  
    L=(SqList *)malloc(sizeof(SqList));  
    free(L);  
}  
//判定是否为空表ListEmpty(L)  
bool ListEmpty(SqList *L)  
{  
    return(L->length==0);  
}  
//求线性表的长度ListLength(L)  
int ListLength(SqList *L)  
{  
    return(L->length);  
}  
//输出线性表DispList(L)  
void DispList(SqList *L)  
{  
    int i;  
    if (ListEmpty(L)) return;  
    for (i=0; i<L->length; i++)  
        printf("%d ",L->data[i]);  
    printf("\n");  
}  
//求某个数据元素值GetElem(L,i,e)  
bool GetElem(SqList *L,int i,ElemType &e)  
{  
    if (i<1 || i>L->length)  return false;  
    e=L->data[i-1];  
    return true;  
}  
//按元素值查找LocateElem(L,e)  
int LocateElem(SqList *L, ElemType e)  
{  
    int i=0;  
    while (i<L->length && L->data[i]!=e) i++;  
    if (i>=L->length)  return 0;  
    else  return i+1;  
}  
//插入数据元素ListInsert(L,i,e)  
bool ListInsert(SqList *&L,int i,ElemType e)  
{  
    int j;  
    if (i<1 || i>L->length+1)  
        return false;   //参数错误时返回false  
    i--;            //将顺序表逻辑序号转化为物理序号  
    for (j=L->length; j>i; j--) //将data[i..n]元素后移一个位置  
        L->data[j]=L->data[j-1];  
    L->data[i]=e;           //插入元素e  
    L->length++;            //顺序表长度增1  
    return true;            //成功插入返回true  
}  
//删除数据元素ListDelete(L,i,e)  
bool ListDelete(SqList *&L,int i,ElemType &e)  
{  
    int j;  
    if (i<1 || i>L->length)  //参数错误时返回false  
        return false;  
    i--;        //将顺序表逻辑序号转化为物理序号  
    e=L->data[i];  
    for (j=i; j<L->length-1; j++) //将data[i..n-1]元素前移  
        L->data[j]=L->data[j+1];  
    L->length--;              //顺序表长度减1  
    return true;              //成功删除返回true  
}

#include "list.h"  
int main()  
{  
    SqList *sq_a, *sq_b, *sq_c;  
    ElemType a[6]= {2,0,1,5,0,9};  
    CreateList(sq_a, a, 6);  
    printf("LA: ");  
    DispList(sq_a);  
  
    ElemType b[6]= {1,2,3,4,5};  
    CreateList(sq_b, b, 5);  
    printf("LB: ");  
    DispList(sq_b);  
    unionList(sq_a, sq_b, sq_c);  
    printf("LC: ");  
    DispList(sq_c);}  

运行结果

<img src="http://img.blog.csdn.net/20151011213524587?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />