DS(LinTabSeqStorStruct)

#include <bits/stdc++.h>
using namespace std;

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ERROR 0
#define OK 1
#define OVERLOW -2

typedef struct {
    int *elem;
    int length;
    int listsize;
} sqlist;

int InitList_Sq(sqlist &L) {
    L.elem = (int *)malloc(sizeof(int) * LIST_INIT_SIZE);
    if (!L.elem) exit(OVERFLOW); 
    L.length = 0;                 
    L.listsize = LIST_INIT_SIZE;  
    return OK;
}

int listinsert(sqlist &L, int i, int e) {
    int *newbase, *p, *q;
    if (i < 1 || i > L.length + 1) return ERROR;
    if (L.length >= L.listsize) {
        newbase =
            (int *)realloc(L.elem, (L.listsize + LISTINCREMENT) * sizeof(int));
        if (!newbase) return OVERFLOW;
        L.elem = newbase;
        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 locate(sqlist L, int e) {
    int i, *p;
    i = 1;
    p = L.elem;
    while (i <= L.length && e != *p) {
        ++i;
        ++p;
    }
    if (i <= L.length)
        return i;
    else
        return 0;
}

void unionmerge(sqlist &la, sqlist lb) {
    int i, e;
    for (i = 0; i < lb.length; ++i) {
        e = *(lb.elem + i);
        if (!locate(la, e)) listinsert(la, la.length + 1, e);
    }
}

int ListDelete_Sq(sqlist &L, int i, int &e) {
    int *p, *q;
    if (i < 1 || i > L.length) return ERROR;  
    p = &(L.elem[i - 1]);                    
    e = *p;                                   
    q = L.elem + L.length - 1;                
    for (++p; p <= q; ++p) *(p - 1) = *p;
    --L.length;
    return OK;
}

int main() {
    int i, m, n, e;
    sqlist la, lb;
    cout << " Please enter the first set la The number of elements in :";
    cin >> m;

    cout << " Please enter the second set lb The number of elements in :";
    cin >> n;
    InitList_Sq(la);

    cout << " Please enter the second set la The number of elements in :";
    for (i = 1; i <= m; ++i) {
        cin >> e;
        listinsert(la, i, e);
    }

    cout << " The first set la Medium " << la.length << " The elements are :";
    for (i = 0; i < la.length; i++) cout << *(la.elem + i) << " ";

    cout << endl;

    InitList_Sq(lb);
    cout << " Please enter the second set lb Elements in :";
    for (i = 1; i <= n; ++i) {
        cin >> e;
        listinsert(lb, i, e);
    }

    cout << " The second set lb Medium " << lb.length << " The elements are :";
    for (i = 0; i < lb.length; i++) cout << *(lb.elem + i) << " ";

    cout << endl;

    unionmerge(la, lb);

    cout << endl;

    cout << " Merged set la Medium " << la.length << " The elements are :";
    for (i = 0; i < la.length; i++) cout << *(la.elem + i) << " ";

    cout << endl;

    cout << " Please enter the number of elements to delete :";
    cin >> i;

    if (ListDelete_Sq(la, i, e)) cout << " The deleted element is :" << e << endl;

    cout << " Set after deletion la Medium " << la.length << " The element is :";
    for (i = 0; i < la.length; i++) cout << *(la.elem + i) << " ";

    cout << endl;

    return 0;
}