数据结构

顺序表的相关应用以及实现：

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#define InitSize 100
#define Size 10
#define overflow -1
#define OK 1
#define error 0
using namespace std;
typedef int elemType;
typedef struct
{
    elemType *elem;
    int length;
    elemType listsize;
}Sqlist;
int Init_Sqlist(Sqlist &L)//初始化一个空表
{
    L.elem=(elemType*)malloc(InitSize*sizeof(elemType));
    if(!L.elem)
        exit(overflow);
    L.length=0;
    L.listsize=InitSize;
    return OK;
}
int Addmalloc(Sqlist &L)
{
    elemType *newbase;
    newbase=(elemType*)realloc(L.elem,(L.listsize+Size)*sizeof(elemType));
    if(!newbase)
        exit(overflow);
    L.elem=newbase;
    L.listsize+=Size;
    return OK;
}
int GetLength(Sqlist &L)
{
    return L.length;
}
void TraveList(Sqlist &L)
{
    for(int i=0;i<L.length-1;i++)
        printf("%d ",L.elem[i]);
    printf("%d\n",L.elem[L.length-1]);
}
void HeadListInsert(Sqlist &L,elemType e)//在顺序表表头插入数据
{
    if(L.length>=L.listsize)
       Addmalloc(L);
    for(int i=L.length-1;i>=1;i--)
        L.elem[i+1]=L.elem[i];
    L.elem[0]=e;
    L.length++;
    return ;
}
void BackListInsert(Sqlist &L,elemType e)//在顺序表尾插入数据
{
    if(L.length>=L.listsize)
        Addmalloc(L);
    L.elem[L.length]=e;
    L.length++;
    return ;
}
int ListInsert(Sqlist &L,int pos,elemType e)//插入数据
{
     if(pos>L.length||pos<1)
        return error;
     if(L.length>=L.listsize)
        Addmalloc(L);
     for(int i=L.length-1;i>=pos;i--)
         L.elem[i+1]=L.elem[i];
     L.elem[pos-1]=e;
     L.length++;
     return OK;
}
int Search(Sqlist &L,elemType e)//查找数据
{
    for(int i=0;i<L.length;i++)
    {
        if(L.elem[i]==e)
            printf("该数据位于顺序表第%d位\n",i+1);
        return i+1;
    }
    printf("未找到！\n");
    return 0;
}
bool Equal(elemType a,elemType b)
{
    if(a == b)
        return true;
    else
        return false;
}
int Getelem(Sqlist &L,int pos,elemType e)
{
    for(int i=0;i<L.length;i++)
    {
        if(L.elem[i]==e)
            return i;
    }
    return 0;
}

int LocateElem_Sq(Sqlist L,elemType e)//在顺序线性表L中查找第1个与e相等，若找到，则返回其在L中的位序，否则返回0
{
    elemType *p;
    int i;
    i = 1; //i的初值为第1个元素的位序
    p = L.elem; //p的初值为第1个元素的储存位置
    while(i <= L.length && !Equal(*p++,e))
        ++i;
    if(i <= L.length) return i;
    else return 0;
}
int ListDelet(Sqlist &L,int pos)//删除某一数据
{
    if(pos<1||pos>L.length)
        return error;
    for(int i=pos;i<L.length;i++)
        L.elem[i-1]=L.elem[i];
    L.length--;
    return OK;
}
int IsEmpty(Sqlist &L)//判断是否集合为空
{
    if(L.length==0)
        return 0;
    else
        return 1;
}
void Inverst(Sqlist &L)
{
    elemType temp;
    int low=0,high=L.length-1;
    for(int i=0;i<L.length/2;i++)
    {
        temp=L.elem[low];
        L.elem[low++]=L.elem[high];
        L.elem[high++]=temp;
    }
    return;
}
int MergeList(Sqlist &LA,Sqlist &LB,Sqlist &LC)//A与B并集A∪B
{
    LC.listsize=LC.length=LA.length+LB.length;
    LC.elem=(elemType*)malloc(LC.listsize*sizeof(elemType));
    if(!LC.elem)
        exit(overflow);
    int i=0,j=0,k=0;
    while(i<LA.length&&j<LB.length)
    {
        if(LA.elem[i]<LB.elem[j])
            LC.elem[k++]=LA.elem[i++];
        else if(LA.elem[i]>LB.elem[j])
            LC.elem[k++]=LB.elem[j++];
            else
                LC.elem[k++]=LB.elem[j++]=LA.elem[i++];
    }
    while(i<LA.length)
        LC.elem[k++]=LA.elem[i++];
    while(j<LB.length)
        LC.elem[k++]=LB.elem[j++];
    LC.length=k;
    return 0;
}
void Union(Sqlist &LA,Sqlist &LB,Sqlist &LC)//A与B并集A∪B
{
    int lengthA=GetLength(LA);
    int lengthB=GetLength(LB);
    for(int i=0;i<LA.length;i++)
        for(int j=0;j<LB.length;j++)
        {
            if(LA.elem[i]!=LB.elem[j])
                ListInsert(LA,i++,LB.elem[j]);
            else
                break;
        }
}
void JiaoList(Sqlist &LA,Sqlist &LB,Sqlist &LC1)//集合A与B交集A∩B
{
    LC1.listsize=LC1.length=min(LA.length,LB.length);
    LC1.elem=(elemType*)malloc(LC1.listsize*sizeof(elemType));
    if(!LC1.elem)
        exit(overflow);
    int k=0;
    for(int i=0;i<LA.length;i++){
        for(int j=0;j<LB.length;j++)
        {
            if(LA.elem[i]==LB.elem[j])
            {
                LC1.elem[k++]=LA.elem[i];
                break;
            }
        }
    }
    LC1.length=k;
}
void ChaList(Sqlist &LA,Sqlist &LB)//A集合与B集合差集A-B
{
    for(int i=0;i<LA.length;i++)
        for(int j=0;j<LB.length;j++)
            if(LA.elem[i]==LB.elem[j])
            ListDelet(LA,i);
}
void show(Sqlist &L)
{
    for(int i=0;i<L.length;i++)
        cout<<L.elem[i]<<" ";
    cout<<endl;
}
int main()
{
    Sqlist LA,LB,LC1;
    Init_Sqlist(LA);
    Init_Sqlist(LB);
    Init_Sqlist(LC1);
    int length=5;
    LA.length=length;
    for(int i=0;i<length;i++)
        scanf("%d",&LA.elem[i]);
    LB.length=length;
    for(int i=0;i<length;i++)
        scanf("%d",&LB.elem[i]);
    /*MergeList(LA,LB,LC);
    show(LC);
    Union(LA,LB,LC);
    show(LC);
    JiaoList(LA,LB,LC1);
    show(LC);*/
    ChaList(LA,LB);
    show(LA);
    return 0;
}