顺序表的插入和删除

#include<stdlib.h>
#include<stdio.h>
#define InitSize 10
typedef struct {
	int* data;   //指示动态分配数组的指针
	int MaxSize;//顺序表的最大容量
	int length;//顺序表的当前长度
}SeqList;
void InitList(SeqList &L) {
	L.data = (int*)malloc(InitSize * sizeof(int));
	//用malloc函数申请一片连续的存储空间
	L.length = 0;
	L.MaxSize = InitSize;
}
/*void IncreaseSize(SeqList& L, int len) {
	int* p = L.data;
	L.data = (int *)malloc((L.MaxSize + len) * sizeof(int));
	for (int i = 0; i < L.length; i++) {
		L.data[i] = p[i]; //将数据复制到新区域
	}
	L.MaxSize = L.MaxSize + len;
	free(p);
}*/
/*bool ListInsert(SeqList& L, int i, int e) {
	if (i<1 || i>L.length + 1) {
		return false;
	}
	if (L.length >= L.MaxSize) {
		return false;
	}
	for (int j = L.length;j >= i;j--) {
		L.data[j] = L.data[j-1];
	}

	L.data[i-1] = e;
	L.length++;
	return true;

}*/
bool ListDelete(SeqList& L, int i, int& e) {
	if (i<1 || i>L.length) {
		return false;
	}
	e = L.data[i - 1];
	for (int j = i; j < L.length;j++) {
		L.data[j-1 ] = L.data[j];
	}
	L.length--;
	return true;
}
int main() {
	SeqList L;
	InitList(L);
	//IncreaseSize(L, 5);
	/*if (ListInsert(L, 3, 4)) {
		printf("插入元素成功");
	}
	else {
		printf("插入失败");
	}*/
	int e = -1;
	if (ListDelete(L, 3, 4)) {
		printf("删除成功,删除的元素是:%d\n",e);

	}
	else {
		printf("删除失败");
	}
	return 0;
}