妙趣横生的算法实例1-2

下面是我写的答案，感觉比书上写的答案还符合题意：

#include <stdio.h>
#include <malloc.h>


#define MaxSize 10


typedef struct 
{
int *elem;
int length;
int listSize;
}Sqlist;


void initSqlist(Sqlist *L)
{
L->elem = (int *)malloc(MaxSize * sizeof(int));
if(!L->elem) return;
L->length = 0;
L->listSize = MaxSize;
}


void delElem(Sqlist *list, int i)
{
int j;


if(i < 1 || i > list->length)
{
printf("非法删除");
return;
}
for(j = i - 1; j < list->length - 1; j++)
{
*(list->elem + j) = *(list->elem + j + 1);
}


list->length = list->length - 1;
}


void main()
{
int i = 0;
int *base;
Sqlist sqlist;
initSqlist(&sqlist);


while(i < 15)
{
if(sqlist.length >= sqlist.listSize)
{
base = (int *)realloc(sqlist.elem, (MaxSize + 10) * sizeof(int));
sqlist.elem = base;
sqlist.listSize = MaxSize + 10;
}


scanf("%d", &(*(sqlist.elem + i)));
(sqlist.length)++;
i++;
}


for(i = 0; i < 15; i++)
{
printf("%d ",*(sqlist.elem + i));
}


delElem(&sqlist, 5);


for(i = 0; i < sqlist.length; i++ )
{
printf("%d ",*(sqlist.elem + i));
}
}