參考書(shū)籍：《大話數(shù)據(jù)結(jié)構(gòu)》
環(huán)境：VS2017

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

#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

#define MAXSIZE 20

typedef int Status;
typedef int ElemType;

Status visit(ElemType c)
{
    printf("%d ", c);
    return OK;
}

typedef struct
{
    ElemType data[MAXSIZE];
    int length;
}SqList;

Status InitList(SqList *L)
{
    L->length = 0;
    return OK;
}

Status ListEmpty(SqList L)
{
    if (L.length == 0)
        return TRUE;
    else
        return FALSE;
}

Status ClearList(SqList *L)
{
    L->length = 0;
    return OK;
}

Status ListLength(SqList L)
{
    return L.length;
}

Status GetElem(SqList L, int i, ElemType *e)
{
    if (L.length == 0 || i<1 || i>L.length)
        return ERROR;

    *e = L.data[i - 1];
    return OK;
}

Status LocateElem(SqList L, ElemType e)
{
    int k;
    if (L.length == 0)
        return 0;
    for (k = 0; k < L.length; k++)
    {
        if (L.data[k] == e)
        {
            break;
        }
    }
    if (k >= L.length)
        return 0;
    return k + 1;
}

Status ListInsert(SqList *L, int i, ElemType e)
{
    int k;
    if (L->length == MAXSIZE)
        return ERROR;
    if (i<1 || i>L->length + 1)
        return ERROR;
    if (i <= L->length)
    {
        for (k = L->length - 1; k >= i - 1; k--)
        {
            L->data[k + 1] = L->data[k];
        }
    }
    L->data[i-1] = e;
    L->length++;
    return OK;
}

Status ListDelete(SqList *L, int i, ElemType *e)
{
    int k;
    if (L->length == 0)
        return ERROR;
    if (i<1 || i>L->length)
        return ERROR;
    *e = L->data[i - 1];
    if (i <= L->length)
    {
        for (k = i; k < L->length; k++)
        {
            L->data[k - 1] = L->data[k];
        }
    }
    L->length--;
    return ERROR;
}

Status ListTraverse(SqList L)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        visit(L.data[i]);
    }
    printf("\n");
    return OK;
}

void UnionL(SqList *La, SqList Lb)
{
    int La_len, Lb_len, i;
    ElemType e;
    La_len = ListLength(*La);
    Lb_len = ListLength(Lb);
    for (i = 1; i <= Lb_len; i++)
    {
        GetElem(Lb, i, &e);
        if (!LocateElem(*La, e))
            ListInsert(La, ++La_len, e);
    }
}

void unionL(SqList *La, SqList Lb)
{
    int La_len, Lb_len, i;
    ElemType e;
    La_len = ListLength(*La);
    Lb_len = ListLength(Lb);
    for (i = 1; i <= Lb_len; i++)
    {
        GetElem(Lb, i, &e);
        if (!LocateElem(*La, e))
            ListInsert(La, ++La_len, e);
    }
}

int main()
{

    SqList L;
    SqList Lb;

    ElemType e;
    Status i;
    int j, k;
    i = InitList(&L);
    printf("初始化L后：L.length=%d\n", L.length);
    for (j = 1; j <= 5; j++)
        i = ListInsert(&L, 1, j);
    printf("在L的表頭依次插入1～5后：L.data=");
    ListTraverse(L);

    printf("L.length=%d \n", L.length);
    i = ListEmpty(L);
    printf("L是否空：i=%d(1:是 0:否)\n", i);

    i = ClearList(&L);
    printf("清空L后：L.length=%d\n", L.length);
    i = ListEmpty(L);
    printf("L是否空：i=%d(1:是 0:否)\n", i);

    for (j = 1; j <= 10; j++)
        ListInsert(&L, j, j);
    printf("在L的表尾依次插入1～10后：L.data=");
    ListTraverse(L);

    printf("L.length=%d \n", L.length);

    ListInsert(&L, 1, 0);
    printf("在L的表頭插入0后：L.data=");
    ListTraverse(L);
    printf("L.length=%d \n", L.length);

    GetElem(L, 5, &e);
    printf("第5個(gè)元素的值為：%d\n", e);
    for (j = 3; j <= 4; j++)
    {
        k = LocateElem(L, j);
        if (k)
            printf("第%d個(gè)元素的值為%d\n", k, j);
        else
            printf("沒(méi)有值為%d的元素\n", j);
    }


    k = ListLength(L); /* k為表長(zhǎng) */
    for (j = k + 1; j >= k; j--)
    {
        i = ListDelete(&L, j, &e); /* 刪除第j個(gè)數(shù)據(jù) */
        if (i == ERROR)
            printf("刪除第%d個(gè)數(shù)據(jù)失敗\n", j);
        else
            printf("刪除第%d個(gè)的元素值為：%d\n", j, e);
    }
    printf("依次輸出L的元素：");
    ListTraverse(L);

    j = 5;
    ListDelete(&L, j, &e); /* 刪除第5個(gè)數(shù)據(jù) */
    printf("刪除第%d個(gè)的元素值為：%d\n", j, e);

    printf("依次輸出L的元素：");
    ListTraverse(L);

    //構(gòu)造一個(gè)有10個(gè)數(shù)的Lb
    i = InitList(&Lb);
    for (j = 6; j <= 15; j++)
        i = ListInsert(&Lb, 1, j);

    unionL(&L, Lb);

    printf("依次輸出合并了Lb的L的元素：");
    ListTraverse(L);

    system("pause");
    return 0;
}