数据结构之线性表的线性分配动态存储

//头文件
#include<stdlib.h>
#include<stdio.h>

//宏定义
#define LIST_INIT_SIZE 100
#define LIST_INCREMENT 10
#define OK 1
#define ERROR 0
#define ONERFLOW -2

//定义线性表结构
typedef struct 
{
    int *elem;
    int length;
    int listSize;
}SqList;

//初始化线性表
int initSqList(SqList &L)
{
    L.elem = (int *)malloc(LIST_INIT_SIZE * sizeof(int));
    if (!L.elem)exit(EOVERFLOW);
    L.length = 0;
    L.listSize = LIST_INIT_SIZE;
    return OK;
}

//在线性表的第i个位置之前插入元素
int SqListInsert(SqList &L, int i, int e)
{
    if (i<1 || i>L.length + 1)return ERROR;
    if (L.length >= L.listSize)
    {
        int *newBase = (int *)malloc((L.listSize + LIST_INCREMENT) * sizeof(int));
        if (!newBase)exit(EOVERFLOW);
        L.elem = newBase;
        L.listSize += LIST_INCREMENT;
    }
    int *q = &(L.elem[i - 1]);
    for (int *p = &(L.elem[L.length - 1]); p >= q; p++)
    {
        *(p + 1) = *p;
    }
    *q = e;
    L.length++;
    return OK;
}

//删除线性表中第i个位置的元素，并用e返回
int sqListDelete(SqList &L, int i, int &e)
{
    if (i<1 || i>L.length)return ERROR;
    int *p = &(L.elem[i - 1]);
    e = *p;
    int *q = &(L.elem[L.length - 1]);
    //int *q = L.elem + L.length - 1;
    for (p++;p<=q; p++)
    {
        *(p - 1) = *p;
    }
    L.length--;
    return OK;
}

//比较是否最小值
int isMinimum(int a, int b)
{
    return a <= b;
}

//比较是否最大值
int isMaximum(int a, int b)
{
    return a >= b;
}

//查找线性表L中第一个和e相同的位序
int searchLocate(SqList L, int e, int(*compare)(int, int))
{
    int i = 1;
    int *p = L.elem;
    while (i <= L.length && !(*compare)(*p++, e))
    {
        i++;
    }
    if (i <= L.length)return i;
    else return 0;
}

//合并链表
//已知链表La和Lb中的元素按值非递减排列
int mergeSqList(SqList &La, SqList &Lb, SqList &Lc)
{
    int *pa = La.elem;
    int *pb = Lb.elem;
    Lc.listSize = Lc.length = La.length + Lb.length;
    int *pc=Lc.elem = (int *)malloc(Lc.listSize*sizeof(int));
    if (!Lc.elem)
    {
        exit(EOVERFLOW);
    }
    int *pa_last = La.elem + La.length - 1;
    int *pb_last = Lb.elem + Lb.length - 1;
    while (pa<=pa_last&&pa<=pb_last)
    {
        if (*pa<=*pb)
        {
            *(pc++) = *(pa++);
        }
        else
        {
            *pc++ = *pb++;

        }
    }
    while (pa <= pa_last)
    {
        *pc++ = *pa++;
    }
    while (pb <= pb_last)
    {
        *pc++ = *pb++;
    }
    free(La.elem);
    free(Lb.elem);
    return OK;
}
//测试
int main()
{
    //第一个链表
    SqList list1;
    initSqList(list1);
    SqListInsert(list1, 1, 1);
    SqListInsert(list1, 2, 2);
    SqListInsert(list1, 3, 3);
    SqListInsert(list1, 4, 4);
    for (int i = 0; i < 4; i++)
    {
        printf("%d ", list1.elem[i]);
    }
    printf("\n");
    int e;
    sqListDelete(list1, 2, e);
    for (int i = 0; i < 3; i++)
    {
        printf("%d ", list1.elem[i]);
    }
    printf("\n");
    int locate = searchLocate(list1,2,isMinimum);
    printf("%d\n",locate);
    locate = searchLocate(list1, 2, isMaximum);
    printf("%d\n", locate);

    //第二个链表
    SqList list2;
    initSqList(list2);
    SqListInsert(list2, 1, 6);
    SqListInsert(list2, 2, 6);
    SqListInsert(list2, 3, 3);
    SqListInsert(list2, 4, 1);
    for (int i = 0; i < 4; i++)
    {
        printf("%d ", list2.elem[i]);
    }
    printf("\n");
    sqListDelete(list2, 2, e);
    for (int i = 0; i < 3; i++)
    {
        printf("%d ", list2.elem[i]);
    }
    printf("\n");
    locate = searchLocate(list2, 2, isMinimum);
    printf("%d\n", locate);
    locate = searchLocate(list2, 2, isMaximum);
    printf("%d\n", locate);
    SqList list3;
    if (mergeSqList(list1, list2, list3))
    {
        for (int i = 0; i < 6; i++)
        {
            printf("%d ", list3.elem[i]);
        }
        printf("\n");
    }
    return 0;
}