从一给定的顺序表L中删除下标i--j(i<=j,包括i、j)的所有元素，假定i、j都是合法的

题目：如题

运行结果：

———-同学，你的代码

#include <stdio.h>
#include <stdlib.h>

#define MaxSize 5
typedef int ElementType;
typedef struct LNode * SeqList;
struct LNode{
    ElementType data[MaxSize];
    ElementType Last;
};

SeqList MakeEmpty();
void print(SeqList L);
void delete_i_to_j(SeqList L,int i,int j);

int main()
{
    SeqList L;
    L = MakeEmpty();
    printf("before delete\n");
    print(L);
    delete_i_to_j(L,1,2);
    printf("\n after delete\n");
    print(L);
    return 0;
}

SeqList MakeEmpty()
{
    SeqList L;
    L = (SeqList)malloc(sizeof(struct LNode));
    L->data[0] = 1;
    L->data[1] = 2;
    L->data[2] = 3;
    L->data[3] = 4;
    L->data[4] = 5;
    L->Last = 4;
    return L;
}

void print(SeqList L)
{
    int i ;
    for(i = 0; i<=L->Last;i++)
    {
        printf(" %d",L->data[i]);
    }
}

void delete_i_to_j(SeqList L,int i,int j)
{
    int k,l;
    if(L == NULL){return;}
    for(k=i,l=j;l<L->Last;k++,l++){
        L->data[k] = L->data[l+1];
    }
    L->Last -=(j-i+1);
}