数据结构2_1

#include <stdlib.h>
#include<malloc.h>
#include<stdio.h>
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OK 1
#define OVERFLOW -2
#define ERROR 0
typedef int ElemType;
typedef int Status;
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
Status InitList(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;
}//InitList_Sq;
Status ListInsert(SqList *L,int i,ElemType e){
int *q,*p,*newbase;
if (i<1||i>L->length+1)return ERROR;//i值不合法
if (L->length>=L->listsize)
{
newbase=(ElemType*)realloc(L->elem,(L->listsize+LISTINCREMENT)*sizeof(ElemType)) ;
if (!newbase)exit(OVERFLOW);
L->elem=newbase;
L->listsize=LISTINCREMENT+L->listsize;
}
q=&(L->elem[i-1]);
for(p=&(L->elem[L->length-1]);p>=q;--p)
*(p+1)=*p;
*q=e;
++L->length;
return OK;
}
int ListLength(SqList L)
{
return(L.length);
}
int LocateElem(SqList L,ElemType e,Status(*compare)(ElemType,ElemType)) {
int i=1;
int *p=L.elem;
while(i<=L.length&&!(*compare)(*p++,e))
++i;
if(i<=L.length)
return i;
else
return 0;
}
ElemType GetElem(SqList L,int i,int *e)
{
*e=L.elem[i-1];
return *e;
}
int compare(int a,int b)
{
if(a!=b)
return 0;
else
return 1;
}
void Union(SqList *La,SqList Lb)
{
int La_len,Lb_len,i,e;
La_len=ListLength(*La);
Lb_len=ListLength(Lb);
for (i=1;i<=Lb_len;i++)
{
GetElem(Lb,i,&e);
if (!LocateElem(*La,e,compare))
ListInsert(La,++La_len,e);
}
}
void main()
{
SqList La,Lb;
int i;
InitList(&La);
InitList(&Lb);
printf("1:");
for(i=0;i<4;i++)
{
scanf("%d",La.elem+i);
++La.length;
}
//printf("%d++%d",La.length,*La.elem+(i-1));
printf("\n2:");
for(i=0;i<5;i++)
{
scanf("%d",Lb.elem+i);
++Lb.length;
}
Union(&La,Lb);
for(i=0;i<La.length;i++)
{
printf("%d",La.elem[i]);
}
}。