试设计一个算法，删除一个顺序表从第i个元素开始的k个元素

• 试设计一个算法，删除一个顺序表从第i个元素开始的k个元素

#include
#include
#include
#define OK 1
#define ERROR 0
#define MAXSIZE 20
typedef int ElemType;
typedef int Status;

typedef struct 
{
    ElemType data[MAXSIZE];
    int Length;
}SqList;

//初始化顺序表
Status InitSqList(SqList * L)
{
    L->Length=0;
    return OK;
}

//顺序表的建立
Status Create(SqList * L,int n)
{
    srand(time(0));
    for(int i=0;idata[i]=rand()%100+1;
        L->Length++;
    }
    return OK;
}

//顺序表的删除
Status Delete(SqList * L,int Location)
{
    if(L->Length==0)    //线性表为空
    return ERROR;
    if(LocationLength)
    {
        for(int i=Location;iLength;i++)
        {
            L->data[i-1]=L->data[i];
        }
        L->Length--;
    }

    return OK;
}


void Print(SqList * L)
{
    for(int i=0;iLength;i++)
    {
        printf("%d ",L->data[i]);
    }
    printf("\n");
}


int main()
{
    SqList L;
    int ElemNumber;
    int Location,Number;
    InitSqList(&L);
    printf("请输入元素个数：\n");
    scanf("%d",&ElemNumber);
    Create(&L,ElemNumber);
    Print(&L);
    printf("请输入删除的位置和删除的元素个数：\n");
    scanf("%d%d",&Location,&Number);
    if(Number>=L.Length)
    {
        printf("输入有误\n");
        return 0;
    }
    else
    {
        while(Number--)
        {
            Delete(&L,Location);
        }
    }
    Print(&L);
    return 0;
}