1、完整代码
#include "stdio.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;
}
int 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;
}
int locateElem(SqList L, ElemType e)
{
for (int i = 0; i < L.length; i++)
{
if (L.data[i] == e)
return i + 1;
}
return 0;
}
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 (int 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 (int k = i; k < L->length; k++)
{
L->data[k - 1] = L->data[k];
}
}
L->length--;
return OK;
}
Status ListTraverse(SqList SL)
{
for (int i = 0; i < SL.length; i++)
{
visit(SL.data[i]);
}
printf("\n");
return OK;
}
void unionL(SqList* La, SqList Lb)
{
int La_len;
int Lb_len;
ElemType e;
La_len = ListLength(*La);
Lb_len = ListLength(Lb);
for (int 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;
int k;
i = InitList(&L);
printf("初始化L后: L.length = %d\n", L.length);
for (int 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个元素的值为:%d\n", e);
for (int j = 3; j <= 4; j++)
{
int k = locateElem(L, j);
if (k)
printf("第%d个元素的值为%d \n", k, j);
else
printf("没有值为%d的元素", j);
}
int K = ListLength(L);
for (int j = K + 1; j >= K; j--)
{
int i = ListDelete(&L, j, &e);
if (i == ERROR)
printf("删除第%d个数据失败 \n", j);
else
printf("删除第%d个元素的值为 %d \n", j, e);
}
printf("依次输出L的元素:");
ListTraverse(L);
j = 5;
ListDelete(&L, j, &e);
printf("删除第%d个元素值为:%d\n", j, e);
printf("依次输出L的元素:");
ListTraverse(L);
i = InitList(&Lb);
for (int j = 6; j <= 15; j++)
{
int i = ListInsert(&Lb, 1, j);
}
unionL(&L, Lb);
printf("依次输出合并了Lb的元素");
ListTraverse(L);
return 0;
}