数据结构学习之路01顺序表

顺序表初始化

typedef struct{
Stu1 elem;
int Length;
int ListSize;
}Sqlist;
int InitSqList(Sqlist &L){
L.elem=(Stu1)malloc(Size*sizeof(Stu1));
if(!L.elem){
printf(“初始化失败！”);
exit(0);
}
L.Length=0;
L.ListSize=Size;
return OK;
}

顺序表插入数据

Sqlist SqListInsert(Sqlist &L,int m,Stu1 e){
if(m<1||m>L.Length+1){
printf(“插入位置有问题”);
return L;
}
if(L.Length>=L.ListSize){
L.elem=(Stu1*)realloc(L.elem,(L.ListSize+LISTINCREMENT)*sizeof(Stu1));
if(!L.elem){
printf(“分配失败！”);
return L;
}
L.ListSize+=LISTINCREMENT;
}
for(int i=L.Length-1;i>=m-1;i–){
L.elem[i+1]=L.elem[i];
}
L.elem[m-1]=e;
L.Length++;
return L;
}

顺序表删除数据

Sqlist DeleteSqList(Sqlist &L,int m,Stu1 e){
if(m<1||m>L.Length){
printf(“删除位置有问题”);
return L;
}
for(int i=m;i<L.Length;i++){
L.elem[i-1]=L.elem[i];
}
L.Length–;
return L;
}

顺序表输出

void DisplaySqlist(Sqlist &L){
for(int i=0;i<L.Length;i++){
printf("%s\t%s\t%s\t%d\n",L.elem[i].no,L.elem[i].name,L.elem[i].gd,L.elem[i].score);
}
printf("\n");
}

顺序表合并01

void Union(Sqlist &La,Sqlist Lb){
int La_len=La.length,Lb_len=Lb.length,e,i;
for(i=1;i<=Lb_len;i++){
GetElem(Lb,i,e);
if(!LocateElem(La,e))
SqListInsert(La,++La_len,e);
}
}

顺序表合并02

void MergeList(Sqlist La,Sqlist Lb,Sqlist &Lc){
InitSqList(Lc);
int La_len=La.length,Lb_len=Lb.length,i=1,j=1,k=0,ai,bj;
while((i<=La_len)&&(j<=Lb_len)){
GetElem(La,i,ai);
GetElem(Lb,j,bj);
if(ai<=bj){
SqListInsert(Lc,++k,ai);
i++;
}
else {
SqListInsert(Lc,++k,bj);
j++;
}
}
while(i<=La_len){
GetElem(La,i++,ai);
SqListInsert(Lc,++k,ai);
}
while(j<=Lb_len){
GetElem(Lb,j++,bj);
SqListInsert(Lc,++k,bj);
}
}