序列操作

int SequenceInit(SeList *l)
{
if(NULL == l) //入参判断
{
return FAILURE;
}

l -> length = 0;

l -> data = (ElemType *)malloc(sizeof(ElemType) * SIZE);//将头文件中数组改为指针时应该给指针分配空间
if(NULL == l -> data)
{
	return FAILURE;
}
return SUCCESS;

}

int SequenceInsrt(SeList *l, int p, ElemType e)
{
int i;

if(NULL == l)
{
	return FAILURE;
}
if(p > l->length + 1 || l->length >= SIZE || p < 1)
{
	return FAILURE;
}

for(i = 0; i < l->length - p + 1; i++)
{
	l->data[l->length - i] = l->data[l->length - i - 1];
}

l->data[p - 1] = e;
l->length++;

return SUCCESS;

}

int SequenceLength(SeList l)//判断长度子函数
{
return l.length;
}

int SequenceEmpty(SeList l)//判断是否为空子函数
{
return(l.length == 0) ? TRUE : FALSE;
}

int GetElem(SeList l, int p, ElemType *e)//输出指定位置内容
{
if(p < 1 || p > l.length)
{
return FAILURE;
}
*e = l.data[p - 1];
return SUCCESS;
}

int SequenceTraverse(SeList l, void (*p)(ElemType))//遍历子函数
{
if(p == NULL)
{
return FAILURE;
}
int i;

for(i = 0; i < l.length; i++)
{
	p(l.data[i]);
}
return SUCCESS;

}

int LocateElem(SeList l, ElemType e)//定位子函数
{
int i;
for(i = 0; i < l.length; i++)
{
if(e == l.data[i])
{
return i + 1;
}
}
return FAILURE;
}

int SequenceDelete(SeList *l, int p, ElemType *e)//删除子函数
{
if(NULL == l)
{
return FAILURE;
}
if(p < 1 || p > l->length)
{
return FAILURE;
}
int i;
*e = l->data[p - 1];

for(i = 0; i < l->length - p; i++)
{
	l->data[p - 1 + i] = l->data[p + i];
}
l->length--;
return SUCCESS;

}

int SequenceClear(SeList *l)//销毁子函数
{
if(NULL == l)
{
return FAILURE;
}
l->length = 0;
return SUCCESS;
}

int SequenceDestroy(SeList *l)//销毁子函数
{
if(NULL == l)
{
return FAILURE;
}
l->length = 0;
free(l->data);
l->data = NULL;
return SUCCESS;
}