顺序存储 C++ 代码实现

#include<iostream>
#define MaxSize 100//宏替换没有分号
#define lenth 5
using namespace std;

typedef struct LNode * List;
struct LNode
{
	int Data[MaxSize];
	int Last;
};

List ListMakeEmpty()
{
	List PtrL;
	PtrL = (List)malloc(sizeof(struct LNode));
	PtrL->Last = -1;
	return PtrL;
}
void insert(int X,int k,List PtrL )
{
	if (k <= (PtrL->Last + 1) && k >= 0)
	{	
		for (int i = (PtrL->Last+1); i >= k; i--)	
		{
		PtrL->Data[i + 1] = PtrL->Data[i];	
		}
		PtrL->Data[k] = X;
		PtrL->Last++;
	}
	else if (k < 0)
	{
		cout << "所插入位置小于0" << endl;
	}
	else if (k > (PtrL->Last + 1))
	{
		cout << "所插入位置在表尾后，且不紧邻表尾" << endl;
	}
}
void Delete(int k, List PrtL)
{
	if (k >= 0 && k <= PrtL->Last)
	{
		for (int i = k; i <= PrtL->Last; i++)
		{
			PrtL->Data[i] = PrtL->