数据结构的顺序线性表的一些函数

第一次发表博客，先发表一个数据结构里面的顺序线性表的一个CPP文件吧。

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


#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;


#define LIST_INIT_SIZE 100  //线性表存储空间的初始分配量
#define LISTINCREMENT 10    //线性表分配空间的分配增量
typedef int ElemType;


typedef struct {
ElemType *elem;//存储空间基址
int length;    //当前长度
int listsize;  //当前分配的存储容量(以sizeof(ElemType)为单位)
}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;  //初始存储容量
}*/


//构造一个非空线性表L
Status Create_Sq(SqList &L, int n) {
int count = 0;
L.elem = (ElemType*)malloc(sizeof(ElemType)*n);
if (!L.elem)
exit(OVERFLOW);  //存储分配失败
printf("请输入线性表：");
for (int i = 0; i < n; i++) {
scanf("%d", &L.elem[i]);
count++;
}
L.length = count;
L.listsize = n;
}


//在顺序线性表L中第i个位置之前插入新的元素e
Status ListInsery_Sq(SqList &L, int i, ElemType e) {
if (i<1 || i>L.length + 1)  //i值不合法
return ERROR;
ElemType *newbase;
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;  //增加存储容量
}
ElemType *q, *p;
q = &(L.elem[i - 1]);  //q为插入位置
for (p = &(L.elem[L.length - 1]); p >= q; --p)
*(p + 1) = *p;    //插入位置及之后的元素右移
*q = e;  //插入e
++L.length;  //表长增1
return OK;
}


//在顺序线性表L中删除第i个元素，并用e返回其值
Status ListDelete_Sq(SqList &L, int i, ElemType &e) {
if (i < 1 || i > L.length)  //i值不合法
return ERROR;
ElemType *p, *q;
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;  //表长减一
return OK;
}


//合并线性表
void MergeList_Sq(SqList La,SqList Lb,SqList &Lc) {
ElemType *pa, *pb, *pc;
pa = La.elem;
pb = Lb.elem;
Lc.length = La.length + Lb.length;
Lc.listsize = Lc.length;
Lc.elem = (ElemType*)malloc(Lc.listsize * sizeof(ElemType));
pc = Lc.elem;
if (!Lc.elem)
exit(OVERFLOW);  //存储分配失败
ElemType *pa_last, *pb_last;
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++;
while (pb <= pb_last)
*pc++ = *pb++;
}


//输出线性表
void Print_Sq(SqList L) {
printf("线性表为：");
for (int i = 0; i < L.length; i++)
printf("%d ", L.elem[i]);
printf("\n");
printf("表长为：%d\n", L.length);
//printf("\n");
}




int main() {
SqList L;
int n;
printf("请输入线性表的长度：");
scanf("%d", &n);
Create_Sq(L, n);
printf("\n");


int a, b;
printf("请输入要插入的元素：");
scanf("%d", &b);
printf("请输入要插入元素的位置：");
scanf("%d", &a);
ListInsery_Sq(L, a, b);
Print_Sq(L);
printf("\n");


int e, f;
printf("请输入要删除的元素的位置：");
scanf("%d", &f);
ListDelete_Sq(L, f, e);
printf("被删除的元素为：%d\n", e);
Print_Sq(L);
printf("\n");


SqList L1, Lc;
int m;
printf("请输入要合并的线性表长度：");
scanf("%d", &m);
Create_Sq(L1, m);
MergeList_Sq(L, L1, Lc);
Print_Sq(Lc);
printf("\n");


return 0;
}