顺序表的插入与删除（数据结构）

顺序表的插入与删除

此部分来自数据结构
不墨迹直接上胎教版代码(同学看了都说好)

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define Max_size 100
//线性表的动态分配顺序储存结构
typedef struct {
	int* elem;
	int length;
	int listsize;
}sqlist; 
//构造一个空的线性表L
int InitList(sqlist &L)
{
	L.elem = new int[Max_size];
	if (!L.elem) exit(0);
	L.length = 0;
	L.listsize = Max_size;
	return 0;
}
//顺序表的插入
//在顺序表L中第i个位置之前插入一个新元素e
int ListInsert(sqlist &L,int i,int e)
{
	int* p,* q;
	if (i<1 || i>L.length + 1) return 0;
	q = &(L.elem[i-1]);
	for (p = &(L.elem[L.length - 1]); p >= q; p--) {
		*(p + 1) = *p;
	}
	*q = e;
	L.length++;
	return 1;
}
//顺序表的删除
//在顺序表L中删除第i个元素，并用e返回其值
int ListDelete(sqlist& L, int i, int &e)
{
	int* p, * q;
	if (i<1 || i>L.length) return 0;
	q = &(L.elem[i-1]);
	e = *q;
	p = L.elem + L.length - 1;
	while( p >= q) {
		*(q - 1) = *q;
		q++;
	}
	L.length--;
	return 1;
}
int main()
{
	sqlist L;
	int i, e, j;
	cout << "初始化顺序表" << endl;
	InitList(L);
	//初始化顺序表

	//在表头依次插入1~10
	cout<<"在表头依次插入1~10"<<endl;
	for (i = 1; i <= 10; i++)
		ListInsert(L, 1, i);
	cout << "在L的表头依次插入1~10后，表中的数据元素值为：" << endl;
	for (i = 1; i <= L.length; i++)
		cout<<L.elem[i - 1]<<" ";
	cout << endl;

	cout<<"在表的i位置插入元素e"<<endl;
	cin >> i >> e;
	ListInsert(L, i, e);
	cout << "在i位置插入e表中的数据元素为：" << endl;
	for (i = 1; i <= L.length; i++)cout << L.elem[i - 1] << " ";
		
	cout << endl;
	cout << "删除表中第i个元素,其值为e"<<endl;
	cin >> i;
	ListDelete(L, i, e);
	for (i = 1; i <= L.length; i++)cout << L.elem[i - 1] << " ";
	cout << endl;
	cout << "删除值为:"<<e<<endl;
	return 0;
}