假设利用两个线性表LA和LB分别表示两个集合A和B（即线性表中的数据元素即为集合中的成员），现要求一个新的集合A=AUB。这就要求对线性表作如下操作：扩大线性表LA，将存在于线性表LB中而不存在于线性表LA中的数据元素插入到线性表LA中去。只要从线性表LB中依次取得每个数据元素，并依值在线性表LA中进行查访，若不存在，则插入之。
main.cpp
#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASALBE -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
typedef int Status;
typedef struct
{
ElemType* elem;
int length;
int listsize;
}SqList;
Status InitList(SqList& L);//InitList
Status DestroyList(SqList& L);//DestroyList
Status ClearList(SqList& L);//ClearList
Status ListEmpty(SqList& L);//ListEmpty
Status ListLength(SqList& L);//ListLength
Status GetElem(SqList& L, int i, int& e);//GetElem
Status compare(ElemType a, ElemType b);//compare
Status LocateElem(SqList L, ElemType e, Status(*compare)(ElemType, ElemType));//LocateElem
Status PriorElem(SqList L, int cur_e, int &pre_e);//PriorElem
Status ListInsert(SqList& L, int i, ElemType e);//NextElem
Status ListInsert(SqList& L, int i, ElemType e);//ListInsert
Status ListDelete(SqList& L, int i, int& e);//ListDelete
Status visit(SqList& L);//visit
Status ListTraverse(SqList& L, Status(*p)(int, SqList));//ListTraverse
void output(SqList& L);//output
void Union(SqList& La, SqList Lb);//Union
Status InitList(SqList& L)
{
L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}//InitList
Status DestroyList(SqList& L)
{
free(&L);
return OK;
}//DestroyList
Status ClearList(SqList& L)
{
free(L.elem);//释放指针L.elem指向的内存，但是指针L.elem指向的地址还是不变，指向的是顺序表的第一个元素的节点
//动态指针是在堆上维护的，动态指针定义后，程序为指针分配了一块内存，而且保证这块内存不会被其他乱七八糟的东西修改。
//free或者delete的时候，是放弃了指针对这个内存的占用，放弃之后，内存的值（顺序表的第一个元素的节点的值）会改写成随机值。
L.elem = NULL;//使顺序表的指针L.elem，使指针L.elem指向NULL（即0），防止产生野指针，避免误访问没有使用权的指针
//野指针就是指针指向的位置是不可知的（随机的、不正确的、没有明确限制的）
L.length = 0;
return OK;
}//ClearList
Status ListEmpty(SqList& L)
{
if (L.length == 0)
return TRUE;
else
return FALSE;
}//ListEmpty
Status ListLength(SqList& L)
{
return L.length;
}//ListLength
Status GetElem(SqList& L, int i, int& e)
{
int j;
for (j = 0; j < ListLength(L); j++)//遍历顺序表Lb
{
if (j == i)//用j定位i
{
e = L.elem[j];//把Lb中第j个，也就是第i个数据元素的值赋值给整数e
return e;
break;
}
}
return ERROR;
}//GetElem
Status compare(ElemType a, ElemType b)
{
if (a == b)
return OK;
else
return ERROR;
}//compare
int LocateElem(SqList L, ElemType e, Status(*compare)(ElemType, ElemType))//Status(*compare)(ElemType, ElemType)意思是定义指向函数的指针变量compare
//Status(*compare)(ElemType, ElemType) Status表明这个函数值（即函数的返回值）是整型的，括号中的两个ElemType，即两个int，表示这个函数有两个int型参数
{
int i = 0;
ElemType *p = L.elem;//定义指针整型指针p指向顺序表La的首地址
while (i <= (L.length - 1) && !(*compare)(*p++, e))//(*compare)(*p++, e)的意思是比较*p++和e，即比较指针p指向顺序表La当前位置的值和Lb[i]的大小
//若相等，则返回OK即返回1，!(*compare)(*p++, e)所以为0，退出while循环
//若不相等，则返回ERROR即返回0，!(*compare)(*p++, e)所以为1，继续向后遍历顺序表La
++i;
if (i <= L.length - 1)//若遍历顺序表La发现和b[i]相等的
{
if (i == 0)
return TRUE;//如果La的第0个数据元素和b[i]相等，则返回i==TRUE，分开写的原因是和下面的else这种情况区分开来
else
return i;//则返回La的当前位置
}
else//若遍历顺序表La发现没有和b[i]相等的
return 0;//否则返回0
}//LocateElem
Status PriorElem(SqList L, int cur_e, int &pre_e)
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
if (i != 0 && cur_e == L.elem[i])
{
judge = 1;
pre_e = L.elem[i - 1];
break;
}
}
if (judge == 0)
return ERROR;
else
return pre_e;
}//PriorElem
Status NextElem(SqList L, int cur_e, int& next_e)
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
if (i != ListLength(L) - 1 && cur_e == L.elem[i])
{
judge = 1;
next_e = L.elem[i + 1];
break;
}
}
if (judge == 0)
return ERROR;
else
return next_e;
}//NextElem
Status ListInsert(SqList& L, int i, ElemType e)//在元素第i个（0<=i<=n-1）之前插入一个数据元素 ，和第n-1个元素之后插入一个数据元素
{
if (i<0 || i>L.length)
return ERROR;
if (L.length >= L.listsize)
{
ElemType* newbase = (ElemType *)realloc(L.elem, (L.listsize + LISTINCREMENT) * sizeof(ElemType));
if (!newbase)
exit(OVERFLOW);
L.elem = newbase;
L.listsize += LISTINCREMENT;
}
ElemType* q = &(L.elem[i]);
for (ElemType *p = &(L.elem[L.length - 1]); p >= q; --p)
*(p + 1) = *p;
*q = e;
++L.length;
return OK;
}//ListInsert
Status ListDelete(SqList& L, int i, int& e)
{
int j;
if (i<0 || i>ListLength(L) - 1)
return ERROR;
e = L.elem[i];
for (j = i; j < ListLength(L) - 1; j++)
L.elem[j] = L.elem[j + 1];
L.length--;
return e;
}//ListDelete
Status visit(int i, SqList L)
{
if (L.elem[i] != NULL)
return OK;
else
return ERROR;
}//visit
Status ListTraverse(SqList& L, Status(*p)(int, SqList))
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
visit(i, L);
if (visit(i, L) == 1)
return OK;
else
return ERROR;
}
return ERROR;
}//ListTraverse
void output(SqList& L)
{
int i;
printf("Result:");
for (i = 0; i < ListLength(L); i++)
printf("%d ", L.elem[i]);
printf("\n");
}//output
Status equal(ElemType a, ElemType b)
{
if (a == b)
return OK;
else
return ERROR;
}//equal
void Union(SqList& La, SqList Lb)
{
int La_len = ListLength(La); int Lb_len = ListLength(Lb);//调用Listlength函数求出顺序表La和Lb的长度
for (int i = 0; i <= Lb_len - 1; i++)
{
ElemType e;//定义整数e
GetElem(Lb, i, e);//把Lb中第i个数据元素的值赋值给整数e
if (!LocateElem(La, e, equal))//LocateElem(La, e, compare)的值是顺序表La的当前位置，若不为0，则说明顺序表La和顺序表Lb存在相等的元素
//则!LocateElem(La, e, compare)为0，不执行下一步的插入操作
//LocateElem(La, e, compare)若为0，则顺序表La不存在和b[i]相等的元素，则!LocateElem(La, e, compare)为 1，执行下一步的插入操作
ListInsert(La, La_len++, e);
}
}//Union
int main()
{
SqList *La = (SqList*)malloc(sizeof(SqList));
printf("InitList La Status: %d\n", InitList(*La));
int k = 5;//随便设一个
int i, n, *r = &k;
printf("Enter List Li Length: ");
scanf("%d", &n);
printf("Enter %d numbers: ", n);
for (i = 0; i < n; i++)
{
scanf("%d", &La->elem[i]);
La->length++;
}
printf("ListLength: %d\n", ListLength(*La));
printf("ListEmpty Status: %d\n", ListEmpty(*La));
printf("GetElem: %d\n", GetElem(*La, 3, *r));//此时e是8，即*r是8
printf("LocateElem: %d\n", LocateElem(*La, 6, compare));//此时e是6
printf("PriorElem %d\n", PriorElem(*La, 6, *r));//此时pre_e是10，即*r是10
printf("NextElem: %d\n", NextElem(*La, 6, *r));//此时next_e是8，即*e是8
printf("ListInsert Status: %d\n", ListInsert(*La, 1, 15));//在i=1的位置之前插入一个数字15
output(*La);
printf("ListDelete Status: %d\n", ListDelete(*La, 2, *r));//删除i=2位置上的元素的值
output(*La);
printf("ListTraverse Status: %d\n", ListTraverse(*La, visit));
output(*La);
SqList *Lb = (SqList*)malloc(sizeof(SqList));
printf("InitList Lb Status: %d\n", InitList(*Lb));
int m;
printf("Enter List Lb length: ");
scanf("%d", &m);
printf("Enter %d numbers: ", m);
for (i = 0; i < m; i++)
{
scanf("%d", &Lb->elem[i]);
Lb->length++;
}
output(*Lb);
Union(*La, *Lb);
output(*La);
printf("ClearList Status: %d\n", ClearList(*La));
output(*La);
printf("ListEmpty Status: %d\n", ListEmpty(*La));
output(*La);
printf("DestroyList Status: %d\n", DestroyList(*La));
// output(*La);//线性表销毁，不要再输出此线性表
return 0;
}
在VS2019下，需将源文件的scanf改为scanf_s：
#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASALBE -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
typedef int Status;
typedef struct
{
ElemType* elem;
int length;
int listsize;
}SqList;
Status InitList(SqList& L);//InitList
Status DestroyList(SqList& L);//DestroyList
Status ClearList(SqList& L);//ClearList
Status ListEmpty(SqList& L);//ListEmpty
Status ListLength(SqList& L);//ListLength
Status GetElem(SqList& L, int i, int& e);//GetElem
Status compare(ElemType a, ElemType b);//compare
Status LocateElem(SqList L, ElemType e, Status(*compare)(ElemType, ElemType));//LocateElem
Status PriorElem(SqList L, int cur_e, int& pre_e);//PriorElem
Status ListInsert(SqList& L, int i, ElemType e);//NextElem
Status ListInsert(SqList& L, int i, ElemType e);//ListInsert
Status ListDelete(SqList& L, int i, int& e);//ListDelete
Status visit(SqList& L);//visit
Status ListTraverse(SqList& L, Status(*p)(int, SqList));//ListTraverse
void output(SqList& L);//output
void Union(SqList& La, SqList Lb);//Union
Status InitList(SqList& L)
{
L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}//InitList
Status DestroyList(SqList& L)
{
free(&L);
return OK;
}//DestroyList
Status ClearList(SqList& L)
{
free(L.elem);//释放指针L.elem指向的内存，但是指针L.elem指向的地址还是不变，指向的是顺序表的第一个元素的节点
//动态指针是在堆上维护的，动态指针定义后，程序为指针分配了一块内存，而且保证这块内存不会被其他乱七八糟的东西修改。
//free或者delete的时候，是放弃了指针对这个内存的占用，放弃之后，内存的值（顺序表的第一个元素的节点的值）会改写成随机值。
L.elem = NULL;//使顺序表的指针L.elem，使指针L.elem指向NULL（即0），防止产生野指针，避免误访问没有使用权的指针
//野指针就是指针指向的位置是不可知的（随机的、不正确的、没有明确限制的）
L.length = 0;
return OK;
}//ClearList
Status ListEmpty(SqList& L)
{
if (L.length == 0)
return TRUE;
else
return FALSE;
}//ListEmpty
Status ListLength(SqList& L)
{
return L.length;
}//ListLength
Status GetElem(SqList& L, int i, int& e)
{
int j;
for (j = 0; j < ListLength(L); j++)//遍历顺序表Lb
{
if (j == i)//用j定位i
{
e = L.elem[j];//把Lb中第j个，也就是第i个数据元素的值赋值给整数e
return e;
break;
}
}
return ERROR;
}//GetElem
Status compare(ElemType a, ElemType b)
{
if (a == b)
return OK;
else
return ERROR;
}//compare
int LocateElem(SqList L, ElemType e, Status(*compare)(ElemType, ElemType))//Status(*compare)(ElemType, ElemType)意思是定义指向函数的指针变量compare
//Status(*compare)(ElemType, ElemType) Status表明这个函数值（即函数的返回值）是整型的，括号中的两个ElemType，即两个int，表示这个函数有两个int型参数
{
int i = 0;
ElemType* p = L.elem;//定义指针整型指针p指向顺序表La的首地址
while (i <= (L.length - 1) && !(*compare)(*p++, e))//(*compare)(*p++, e)的意思是比较*p++和e，即比较指针p指向顺序表La当前位置的值和Lb[i]的大小
//若相等，则返回OK即返回1，!(*compare)(*p++, e)所以为0，退出while循环
//若不相等，则返回ERROR即返回0，!(*compare)(*p++, e)所以为1，继续向后遍历顺序表La
++i;
if (i <= L.length - 1)//若遍历顺序表La发现和b[i]相等的
{
if (i == 0)
return TRUE;//如果La的第0个数据元素和b[i]相等，则返回i==TRUE，分开写的原因是和下面的else这种情况区分开来
else
return i;//则返回La的当前位置
}
else//若遍历顺序表La发现没有和b[i]相等的
return 0;//否则返回0
}//LocateElem
Status PriorElem(SqList L, int cur_e, int& pre_e)
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
if (i != 0 && cur_e == L.elem[i])
{
judge = 1;
pre_e = L.elem[i - 1];
break;
}
}
if (judge == 0)
return ERROR;
else
return pre_e;
}//PriorElem
Status NextElem(SqList L, int cur_e, int& next_e)
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
if (i != ListLength(L) - 1 && cur_e == L.elem[i])
{
judge = 1;
next_e = L.elem[i + 1];
break;
}
}
if (judge == 0)
return ERROR;
else
return next_e;
}//NextElem
Status ListInsert(SqList& L, int i, ElemType e)//在元素第i个（0<=i<=n-1）之前插入一个数据元素 ，和第n-1个元素之后插入一个数据元素
{
if (i<0 || i>L.length)
return ERROR;
if (L.length >= L.listsize)
{
ElemType* newbase = (ElemType*)realloc(L.elem, (L.listsize + LISTINCREMENT) * sizeof(ElemType));
if (!newbase)
exit(OVERFLOW);
L.elem = newbase;
L.listsize += LISTINCREMENT;
}
ElemType* q = &(L.elem[i]);
for (ElemType* p = &(L.elem[L.length - 1]); p >= q; --p)
*(p + 1) = *p;
*q = e;
++L.length;
return OK;
}//ListInsert
Status ListDelete(SqList& L, int i, int& e)
{
int j;
if (i<0 || i>ListLength(L) - 1)
return ERROR;
e = L.elem[i];
for (j = i; j < ListLength(L) - 1; j++)
L.elem[j] = L.elem[j + 1];
L.length--;
return e;
}//ListDelete
Status visit(int i, SqList L)
{
if (L.elem[i] != NULL)
return OK;
else
return ERROR;
}//visit
Status ListTraverse(SqList& L, Status(*p)(int, SqList))
{
int i, judge;
for (i = 0, judge = 0; i < ListLength(L); i++)
{
visit(i, L);
if (visit(i, L) == 1)
return OK;
else
return ERROR;
}
return ERROR;
}//ListTraverse
void output(SqList& L)
{
int i;
printf("Result:");
for (i = 0; i < ListLength(L); i++)
printf("%d ", L.elem[i]);
printf("\n");
}//output
Status equal(ElemType a, ElemType b)
{
if (a == b)
return OK;
else
return ERROR;
}//equal
void Union(SqList& La, SqList Lb)
{
int La_len = ListLength(La); int Lb_len = ListLength(Lb);//调用Listlength函数求出顺序表La和Lb的长度
for (int i = 0; i <= Lb_len - 1; i++)
{
ElemType e;//定义整数e
GetElem(Lb, i, e);//把Lb中第i个数据元素的值赋值给整数e
if (!LocateElem(La, e, equal))//LocateElem(La, e, compare)的值是顺序表La的当前位置，若不为0，则说明顺序表La和顺序表Lb存在相等的元素
//则!LocateElem(La, e, compare)为0，不执行下一步的插入操作
//LocateElem(La, e, compare)若为0，则顺序表La不存在和b[i]相等的元素，则!LocateElem(La, e, compare)为 1，执行下一步的插入操作
ListInsert(La, La_len++, e);
}
}//Union
int main()
{
SqList* La = (SqList*)malloc(sizeof(SqList));
printf("InitList La Status: %d\n", InitList(*La));
int k = 5;//随便设一个
int i, n, * r = &k;
printf("Enter List Li Length: ");
scanf_s("%d", &n);
printf("Enter %d numbers: ", n);
for (i = 0; i < n; i++)
{
scanf_s("%d", &La->elem[i]);
La->length++;
}
printf("ListLength: %d\n", ListLength(*La));
printf("ListEmpty Status: %d\n", ListEmpty(*La));
printf("GetElem: %d\n", GetElem(*La, 3, *r));//此时e是8，即*r是8
printf("LocateElem: %d\n", LocateElem(*La, 6, compare));//此时e是6
printf("PriorElem %d\n", PriorElem(*La, 6, *r));//此时pre_e是10，即*r是10
printf("NextElem: %d\n", NextElem(*La, 6, *r));//此时next_e是8，即*e是8
printf("ListInsert Status: %d\n", ListInsert(*La, 1, 15));//在i=1的位置之前插入一个数字15
output(*La);
printf("ListDelete Status: %d\n", ListDelete(*La, 2, *r));//删除i=2位置上的元素的值
output(*La);
printf("ListTraverse Status: %d\n", ListTraverse(*La, visit));
output(*La);
SqList* Lb = (SqList*)malloc(sizeof(SqList));
printf("InitList Lb Status: %d\n", InitList(*Lb));
int m;
printf("Enter List Lb length: ");
scanf_s("%d", &m);
printf("Enter %d numbers: ", m);
for (i = 0; i < m; i++)
{
scanf_s("%d", &Lb->elem[i]);
Lb->length++;
}
output(*Lb);
Union(*La, *Lb);
output(*La);
printf("ClearList Status: %d\n", ClearList(*La));
output(*La);
printf("ListEmpty Status: %d\n", ListEmpty(*La));
output(*La);
printf("DestroyList Status: %d\n", DestroyList(*La));
// output(*La);//线性表销毁，不要再输出此线性表
return 0;
}
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
