顺序表-删除重复的元素(有序)

/*从有序顺序表中删除所有其值重复的元素，使表中所有元素的值均不同*/
#include<stdio.h>
#include<stdlib.h>
#define InitSize 20
typedef int ElemType;
typedef struct{
	ElemType *data;
	int length;
}SqList;

bool InitList(SqList &L)
{
	L.data = (ElemType*)malloc(sizeof(ElemType)*InitSize);
	L.length = 0;
	return true;
}

bool deleRepeatElem(SqList &L)
{
	if(L.length == 0)return false;
	int i,j;
	for(i=0,j=1;j<L.length;++j)
		if(L.data[i]!=L.data[j])
			L.data[++i] = L.data[j];
	L.length = i+1;
	return true;
}

bool printList(SqList L)
{
	for(int i=0;i<L.length;++i)
		printf("%d ",L.data[i]);
	printf("\n");
	return true;
}

void main()
{
	SqList L;
	InitList(L);
	int a[11] = {1,2,2,2,2,3,3,3,4,4,5};
	for(int i=0;i<11;++i)
	{
		L.data[i] = a[i];
		++L.length;

	}
	printList(L);
	deleRepeatElem(L);
	printList(L);
	printf("%d\n",L.length);
}