顺序表实现

#include "stdio.h"
#include "stdlib.h"

#define LIST_INIT_SIZE 1000
#define LISTINVRESEMENT 100
#define OK 1
#define ERROR 0
#define OVERFLOW -2

typedef int elemType;
typedef struct{
    elemType *List;
    int length;
    int listsize;
}SqList;

void AgainMalloc(SqList *L){
    elemType *newbase;
    newbase = (elemType *)realloc(L->List,(L->listsize + LISTINVRESEMENT) * sizeof(elemType));
    if(!newbase)
        exit(OVERFLOW);
    L->List = newbase;
    L->listsize += LISTINVRESEMENT;
}

int InitList_Sq(SqList *L){
    L->List = (elemType *)malloc(LIST_INIT_SIZE * sizeof(elemType));
    if(!L->List)
        exit(OVERFLOW);
    L->length = 0;
    L->listsize = LIST_INIT_SIZE;
    return OK;
}

int ListLength(SqList *L){
    return L->length;
}

void TraverseList(SqList *L){
    int i;
    for(i = 0; i < L->length; i++){
        printf("%d",L->List[i]);
    }
    printf("\n");
    return;
}

void InsertFirst(SqList *L,elemType e){
    int i;
    if(L->length >= L->listsize){
        AgainMalloc(L);
    }
    for(i = L->length-1; i >= 0; i++){
        L->List[i+1] = L->List[i];
    }
    L->List[0] = e;
    L->length++;
    return;
}

void InsertLast(SqList *L,elemType e){
    if(L->length >= L->listsize){
        AgainMalloc(L);
    }
    L->List[L->length] = e;
    L->length++;
    return;
}

int Insert_Sq(SqList *L,elemType e,int pos){
    int i;
    if(pos < i || pos > L->length+1)
        return ERROR;
    if(L->length >= L->listsize){
        AgainMalloc(L);
    }
    for(i = L->length-1; i >= pos-1; i++){
        L->List[i+1] = L->List[i];
    }
    L->List[pos-1] = e;
    L->length++;
    return OK;
}

void Search(SqList *L,elemType e){
    int i;
    for(i = 0; i < L->length; i++){
        if(L->List[i] == e){
            printf("%d在第%d个位置",e,i+1); 
            return;
        }
    }
    printf("没有找到！\n");
    return;
}

elemType DeleteElem(SqList *L,int pos){
    int i;
    elemType temp;
    if(pos < 1 || pos > L->length){
        printf("pos越界\n");
        exit(1);
    }
    temp = L->List[pos - 1];
    for(i = pos; i < L->length; i++){
        L->List[i - 1] = L->List[i];
    }
    L->length--;
    return temp;
}

int isEmpty(SqList *L){
    if(L->length == 0)
        return 1;
    else
        return 0;
}

void Inverse(SqList *L){
    int low = 0, high = L->length - 1;
    elemType temp;
    int i;
    for(i = 0; i < L->length/2; i++){
        temp=L->List[low];  
        L->List[low++]=L->List[high];  
        L->List[high--]=temp; 
    }
}

//合并顺序表
void MergeList(SqList *La, SqList *Lb, SqList *Lc){
    Lc->listsize = Lc->length = La->length + Lb->length;
    Lc->List = (elemType *)malloc(sizeof(elemType));
    if(!Lc->List)
        exit(OVERFLOW);
    int i = 0, j = 0, k = 0;
    while(i < La->length && j < Lb->length){
        if(La->List[i] <= Lb->List[j])
            Lc->List[k++] = La->List[i++];
        else
            Lc->List[k++] = Lb->List[j++];
    }
    while(i < La->length)
        Lc->List[k++] = La->List[i++];
    while(j < Lb->length)
        Lc->List[k++] = Lb->List[j++];
}
int main(){  
    SqList list1;  
    InitList_Sq(&list1);  
    int length;  
    scanf("%d",&length);  
    int i;  
    elemType temp;  
    for(i=0; i<length; i++){  
        scanf("%d",&temp);  
        InsertLast(&list1,temp);  
    }  
    printf("创建好的线性表La=");  
    TraverseList(&list1);//创建好的顺序表  
    int pos;  
    scanf("%d%d",&temp,&pos);  
    Insert_Sq(&list1,temp,pos);  
    printf("插入一个元素后的线性表La=");  
    TraverseList(&list1);//插入一个数字后的线性表  
    scanf("%d",&pos);  
    DeleteElem(&list1,pos);  
    printf("删除一个元素后的线性表La=");  
    TraverseList(&list1);  
    scanf("%d",&temp);  
    Search(&list1,temp);//查找元素  
    printf("逆置后的线性表La=");  
    Inverse(&list1);  
    TraverseList(&list1);  
    SqList list2;  
    InitList_Sq(&list2);  
    scanf("%d",&length);  
    for(i=0; i<length; i++){  
        scanf("%d",&temp);  
        InsertLast(&list2,temp);  
    }  
    SqList list3;  
    MergeList(&list1,&list2,&list3);  
    printf("合并La和Lb后的线性表=");  
    TraverseList(&list3);  
    return 0;  
}