模版实现顺序表

void InitSeqList(SeqList* pSeq)

{

assert(pSeq);

memset(pSeq->array,0,sizeof(DataType) * 100);

pSeq->size = 0;

}

void PrintSeqList(SeqList* pSeq)

{

int i = 0;

assert(pSeq);

for(;i<pSeq->size;i++)

{

printf("%d ",pSeq->array[i]);

}

printf("\n");

}

void PushBack(SeqList* pSeq, DataType x)  //尾插

{

assert(pSeq);

if(pSeq->size > MAX_SIZE )

{

printf("seqlist is full");

}

pSeq->array[pSeq->size++] = x;

}

void PopBack(SeqList* pSeq)

{

assert(pSeq);

if(pSeq->size == 0)

{

printf("seqlist is empty");

}

pSeq->size--;

}

void PushFront(SeqList* pSeq, DataType x)// 1 2 3 4 5   size = 5

{

int i = pSeq->size - 1;

assert(pSeq);

if(pSeq->size > MAX_SIZE)

{

printf("seqlist is full");

}

for(;i >= 0;i--)

{

pSeq->array[i+1] = pSeq->array[i];

}

pSeq->array[0] = x;

pSeq->size++;

}

void PopFront(SeqList* pSeq)

{

int i = 1;

assert(pSeq);

if(pSeq->size == 0)

{

printf("seqlist is empty");// 0 1 2 3 4 5

}

for(; i<pSeq->size;i++)

{

pSeq->array[i-1] = pSeq->array[i];

}

pSeq->size--;

}

void Insert(SeqList* pSeq, size_t index, DataType x)

{

assert(pSeq);// 1 2 3 4 5

size_t end = pSeq->size;

assert(index <= pSeq->size);

if (pSeq->size > MAX_SIZE - 1)

{

printf("SeqList is Full\n");

return;

}

for(; end > index; --end)

{

pSeq->array[end] = pSeq->array[end - 1];

}

pSeq->array[index] = x;

pSeq->size++;

}

FindRet Find(SeqList* pSeq, DataType x, size_t index)

{

FindRet ret;

assert(pSeq);

for (; index < pSeq->size; ++index)

{

if (x == pSeq->array[index])

{

ret.isFind = TRUE;

ret.index = index;

return ret;

}

}

ret.isFind = FALSE;

return ret;

}