设计删除顺序表中【x，y】中的所有元素算法

#include <iostream>
#include <stdlib.h>
using namespace std;
#define MaxSize 10
typedef char ElemType;
typedef struct
{
ElemType data[MaxSize];
int length;
}SqList;
void InitiList(SqList *&L,ElemType a[],int n);//初始化顺序表
void DisplayList(SqList *L);//显示顺序表
<span style="color:#ff0000;">bool DeleteX_YList(SqList *L,int x,int y);//删除x，y之间的元素</span>
int main()
{
SqList *L=new SqList();
ElemType a[]={'a','b','c','d','e','f','g','l'};
InitiList(L,a,8);
DisplayList(L);
cout<<endl;
DeleteX_YList(L,1,4);
DisplayList(L);
return 0;
}
<span style="color:#ff0000;">bool DeleteX_YList(SqList *L,int x,int y)//删除x，y之间的元素
{
if((y-x)>(L->length)||(y<x))
return false;
else
{
int i=y;
for(int j=x-1;i<L->length;j++,i++)
L->data[j]=L->data[i];
L->length-=(y-x+1);
return true;
}
}</span>
void DisplayList(SqList *L)//显示顺序表
{
for(int i=0;i<L->length;i++)
cout<<L->data[i]<<" ";
}
void InitiList(SqList *&L,ElemType a[],int n)//初始化顺序表
{
L = (SqList*)malloc(sizeof(SqList));
for(int i=0;i<n;i++)
L->data[i]=a[i];
L->length=n;
}