C：顺序线性表基本操作严蔚敏版[新手向]①

顺序线性表基本操作严蔚敏版[新手向]①

近段时间本人在复习数据结构，重新敲一次代码，有什么不足的地方望大佬多多指教，严蔚敏版教程配套算法代码

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

#define LIST_INIT_SIZE 100//初始分配量 
#define LISTINCREMENT 10//分配增量 

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef int Status;
typedef int ElemType;
//结构体
typedef struct {
	ElemType* elem;//储存空间基址
	int length;//当前长度
	int listsize;//当前分配空间的储存容量
} SqList;
//创造空线性表L
Status InitList_Sq(SqList& L) {
	L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
	if (!L.elem)exit(OVERFLOW);//储存分配失败
	L.length = 0;//空表长度为0
	L.listsize = LIST_INIT_SIZE;//初始储存容量
	printf("\n成功建立一个线性表\n");
	return OK;
}
//摧毁线性表
void DestoryList_Sq(SqList& L) {
	free(L.elem);
	L.elem = NULL;
	L.length = 0;
	L.listsize = 0;
	printf("\n成功摧毁一个线性表\n");
}
//清空线性表
void ClearList_Sq(SqList& L) {
	L.length = 0;
	printf("\n成功清空一个线性表\n");
}

//判断线性表是否为空
Status ListEmpty_Sq(SqList L) {
	if (L.length == 0)return TRUE;
	else return FALSE;
}
//判断线性表的长度
int ListLength_Sq(SqList L) {
	printf("\n线性表长度为%d\n", L.length);
	return L.length;
}
//获得线性表第i个元素
Status GetElem_Sq(SqList L, int i, ElemType& e) {
	if (i<1 || i>L.length)
		return ERROR;
	else {
		e = L.elem[i - 1];
	}
	return OK;
}
//在顺序表中寻找元素i并返回元素位置
int LocateElem_Sq(SqList L, ElemType e, Status(*compare)(ElemType, ElemType)) {
	ElemType i = 1, * p;
	p = L.elem;
	while (i <= L.length && !(*compare)(*p++, e))
		i++;
	if (i <= L.length)
		return i;
	else
		return 0;
}
//顺序线性表中第i个位置插入元素e,i的合法值为1---ListLength_Sq(L)+1
Status ListInsert_Sq(SqList& L, int i, ElemType e) {
	ElemType* newbase, * p, * q;
	if (i<1 || i>L.length + 1)return ERROR;//i不合法
	if (L.length >= L.listsize) {//当前储存已满，增加分配
		newbase = (ElemType*)realloc(L.elem, (L.listsize + LISTINCREMENT ) * sizeof(ElemType));
		if (!newbase)exit(OVERFLOW);//储存分配失败
		L.elem = newbase;//新基址
		L.listsize += LISTINCREMENT;//增加储存容量
	}
	q = &(L.elem[i - 1]);//q为插入位置
	for (p = &(L.elem[L.length - 1]); p >= q; p--)*(p + 1) = *p;//插入位置及之后元素后移
	*q = e;//插入e
	++L.length;//表长加一
	return OK;
}
//线性表插入数据
Status ListIn_Sq(SqList& L) {
	ElemType e, i = 1;
	do {
		scanf("%d", &e);
		ListInsert_Sq(L, i, e);
		i++;
	} while (getchar() == ' ');
	printf("\n成功插入数据串\n");
	return OK;
}
//遍历操作函数，线性表查询数据
Status visit(ElemType e) {
	printf("%d ",e);
	return OK;
}
Status ListTraverse(SqList& L,Status (*visit)(ElemType)) {
	ElemType i,e;
	for (i = 1; i <= L.length; i++) {
		GetElem_Sq(L, i, e);
		visit(e);
	}
	printf("\n成功查询数据\n");
}
//删除第i个元素，并把它赋值给e
Status ListDelete_Sq(SqList& L, int i, ElemType e) {
	ElemType* p, * q;
	if ((i < 1) || (i > L.length))return ERROR;//i不合法
	p = &(L.elem[i - 1]);//p为被删除元素位置
	e = *p; //被删除的元素赋值给e
	q = L.elem + L.length - 1;//表尾元素的位置
	for (++p; p <= q; ++p) {//被删除元素之后的元素左移
		*(p - 1) = *p;
	}
	--L.length;//表长减一
	printf("\n线性表中成功删除元素\n");
	return OK;
}
//对一个顺序表取反
void ReverseList_Sq(SqList& L) {
	ElemType array[L.length];
	for(int i=0; i<L.length; i++) {
		array[L.length-i-1]=L.elem[i];
	}
	for(int i=0; i<L.length; i++) {
		L.elem[i]=array[i];
	}
	printf("逆序成功");
}
//顺序表合并按照非递减值排序
void MergeList_Sq(SqList La, SqList Lb, SqList& Lc) {
	//不取地址符为复制，取地址符为修改
	ElemType* pa, * pb, * pc, * pa_last, * pb_last;
	pa = La.elem;
	pb = Lb.elem;
	Lc.listsize = Lc.length = La.length + Lb.length;
	pc = Lc.elem = (ElemType*)malloc(Lc.listsize * sizeof(ElemType));
	if (!Lc.elem)exit(OVERFLOW);//储存分配失败
	pa_last = La.elem + La.length - 1;
	pb_last = Lb.elem + Lb.length - 1;
	while (pa <= pa_last && pb <= pb_last) {//归并
		if (*pa <= *pb)*pc++ = *pa++;
		else *pc++ = *pb++;
	}
	while (pa <= pa_last)*pc++ = *pa++;//插入La剩余元素
	while (pb <= pb_last)*pc++ = *pb++;//插入Lb剩余元素
	printf("\n线性表成功合并\n");
}

int main() {
	SqList L,P;
	ElemType e, i;
	//初始化
	InitList_Sq(L);
	InitList_Sq(P);

	//插入一串元素
	ListIn_Sq(L);
	ListTraverse(L,visit);

	//插入一串元素
	ListIn_Sq(P);
	ListTraverse(P,visit);

	//删除元素
	ListDelete_Sq(L,4,e);
	ListTraverse(L,visit);
	
	//合并元素
	MergeList_Sq(L,P,L);
	ListTraverse(L,visit);

	//逆序元素
	ReverseList_Sq(P);
	ListTraverse(P,visit);
}