线性表的顺序表示

#include <stdio.h>
#include <stdlib.h>

#define TRUE        1
#define FALSE       0
#define OK          1
#define ERROR       0
#define INFEASIBLE  -1
#define OVERFLOW    -2

typedef int Status;
typedef int ElemType;

#define LIST_INIT_SIZE  100
#define LISTINCREMENT   10

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)
        return OVERFLOW;
    L->length = 0;
    L->listsize = LIST_INIT_SIZE;
}

//销毁线性表
Status DestroyList(SqList *L) {
    free(L->elem);
    L->length = 0;
    L->listsize = 0;
    L->elem = NULL;

    return OK;
}

//判断是否为空表
Status ListEmpty(SqList *L) {
    if (L->length) {
        return OK;
    }

    return ERROR;
}

//置线性表为空表
Status ClearList(SqList *L) {
    int i;
    for (i = 0; i < L->length; i++) {
        L->elem[i] = 0;
    }
    L->length = 0;

    return OK;
}

//在第i个元素之前插入e
Status ListInsert(SqList *L, int i, ElemType e) {
    int *p, *q;
    if (i < 1 || i > L->length + 1) {
        printf("插入位置不合理！\n");
        return ERROR;
    }

    if (L->length >= L->listsize) {
        L->elem = (ElemType *)realloc(L->elem, (L->listsize + LISTINCREMENT) * sizeof(ElemType));
        L->listsize += LISTINCREMENT;
    }
    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 ListDelete(SqList *L, int i) {
    int *p, *q;
    if (i < 1 || i > L->length) {
        printf("删除位置不合理！\n");
        return ERROR;
    }
    q = &(L->elem[i - 1]);
    for (p = q + 1; p < &(L->elem[L->length]); p++) {
        *(p - 1) = *p;
    }
    --L->length;

    return OK;
}

//打印线性表
void ListTraverse(SqList *L) {
    int i;
    for (i = 0; i < L->length; i++) {
        printf("%d ", L->elem[i]);
    }
    printf("\n");
}

//得到第n个元素
ElemType GetElem(SqList *L, int index) {
    if (index < 1 || index > L->length) {
        printf("目标下标越界！\n");
        return ERROR;
    }
    return L->elem[index - 1];
}

//得到线性表长度
int GetListLength(SqList *L) {
    return L->length;
}

//修改目标下标元素
Status ModifyElem(SqList *L, int index, ElemType newElem) {
    if (index < 1 || index > L->length) {
        printf("目标下标越界！\n");
        return ERROR;
    } else {
        L->elem[index - 1] = newElem;
        return OK;
    }
}

//返回目标元素是第几个
int LocateElem(SqList *L, ElemType elem) {
    int i;
    for (i = 0; i < L->length; i++) {
        if (L->elem[i] == elem) {
            return i + 1;
        }
    }
    return FALSE;
}

//返回目标数据元素的前驱
ElemType PriorElem(SqList *L, ElemType elem) {
    int index = LocateElem(L, elem);
    if (index == 0 || index == 1) {
        return FALSE;
    } else {
        return L->elem[index - 2];
    }
}

//返回目标元素的后继
ElemType NextElem(SqList *L, ElemType elem) {
    int index = LocateElem(L, elem);
    if (index == 0 || index == L->length) {
        return FALSE;
    } else {
        return L->elem[index];
    }
}

//线性表的转置
Status ListReverse(SqList *L) {
    int i, tmp;
    for (i = 0; i < L->length / 2; i++) {
        tmp = L->elem[i];
        L->elem[i] = L->elem[L->length - i - 1];
        L->elem[L->length - i - 1] = tmp;
    }

    return OK;
}

int main() {
    SqList L;
    int i;
    InitList(&L);
    for (i = 1; i <= 10; i++) {
        ListInsert(&L, i, i);
    }
    ListTraverse(&L);
    for(i = 1; i <= 5; i++) {
        ListDelete(&L, 1);
    }
    ListTraverse(&L);
    printf("%d\n", PriorElem(&L, 10));
    printf("%d\n", NextElem(&L, 6));
    ListReverse(&L);
    ListTraverse(&L);
    return 0;
}