C语言实现顺序表

定义顺序表

#define MAX_SIZE 5
typedef int DataType;

typedef struct SeqList
{
	DataType array[MAX_SIZE];
	size_t size;
}SeqList;

实现的函数声明：

void PrintSeqlist(SeqList* pSeq);
void InitSeqList(SeqList* pSeq);
void PushBack(SeqList* pSeq, DataType x);
void PopBack(SeqList* pSeq);
void PushFront(SeqList* pSeq, DataType x);
void PopFront(SeqList* pSeq);
void Insert(SeqList* pSeq, size_t pos, DataType x);
void Erase(SeqList* pSeq, size_t pos);
int Find(SeqList* pSeq, size_t pos,DataType x);


int Remove(SeqList* pSeq, DataType x);
void RemoveAll(SeqList* pSeq, DataType x);

函数实现如下：

void PrintSeqlist(SeqList* pSeq)
{
	assert(pSeq != NULL);
	for (int i = 0; i <pSeq->size; ++i)
	{
		printf("%d ", pSeq->array[i]);
	}
	printf("\n");
}

void InitSeqList(SeqList* pSeq)
{
 	assert(pSeq != NULL);
	memset(pSeq->array, 0, sizeof(DataType)*MAX_SIZE);
	pSeq->size = 0;
}

void PushBack(SeqList* pSeq, DataType x)
{
	assert(pSeq != NULL);
	if (pSeq->size > MAX_SIZE)
	{
		printf("SeqList is FUll\n");
		return;
	}
	pSeq->array[pSeq->size++] = x;

}


void PopBack(SeqList* pSeq)
{
	assert(pSeq);
	if (pSeq->size <= 0)
	{
		printf("SeqList is empty");
		return;
	}
	--pSeq->size;
}

void PushFront(SeqList* pSeq, DataType x)
{
	assert(pSeq != NULL);
	for (int i = pSeq->size; i > 0; --i)
	{
		pSeq->array[i] = pSeq->array[i - 1];
	}
	pSeq->array[0] = x;
	++pSeq->size;
}

void	PopFront(SeqList* pSeq)
{
	assert(pSeq != NULL);
	if (pSeq->size <= 0)
	{
		printf("SeqList is empty");
		return;
	}
	for (int i = 0; i < pSeq->size-1; ++i)
	{
		pSeq->array[i] = pSeq->array[i + 1];
	}
	--pSeq->size;
}

void Insert(SeqList* pSeq, size_t pos, DataType x)
{
	assert(pSeq);
	if (pSeq->size >= MAX_SIZE)
	{
		printf("SeqList is FUll\n");
		return;
	}
	if (pos > pSeq->size)
	{
		printf("error");
		return;
	}
	for (int i = pSeq->size; i > pos; --i)
	{
		pSeq->array[i] = pSeq->array[i - 1];
	}
	pSeq->array[pos] = x;
	++pSeq->size;
}

int Find(SeqList* pSeq, size_t pos,DataType x)
{
	for (int i = pos; i < pSeq->size; ++i)
	{
		if (pSeq->array[i]==x)
		{
			return i;
		}
	}
	return -1;
}

void Erase(SeqList* pSeq, size_t pos)
{
	assert(pSeq != NULL);
	if (pSeq->size <= 0)
	{
		printf("SeqList is FUll\n");
		return;
	}
	if (pos >= pSeq->size)
	{
		printf("error");
		return;
	}
	for (size_t i =pos; i < pSeq->size - 1; ++i)
	{
		pSeq->array[i] = pSeq->array[i + 1];
	}
	--pSeq->size;

}

int Remove(SeqList* pSeq, DataType x)
{
	assert(pSeq != NULL);
	int index = Find(pSeq, 0, x);
	if (index != -1)
	{
		Erase(pSeq, index);
	}
	return index;
}
void RemoveAll(SeqList* pSeq, DataType x)
{
	assert(pSeq != NULL);
	assert(pSeq != NULL);
	//int index = Find(pSeq, 0, x);
	//while (index != -1)
	//{
	//	Erase(pSeq, index);
	//	 index = Find(pSeq, 0, x);
	//}
	int newindex = 0;
	int count = 0;
	for (int i = 0; i < pSeq->size; ++i)
	{
		if (pSeq->array[i] != x)
		{
			pSeq->array[newindex++] = pSeq->array[i];
		}
		else
		{
			++count;
		}
	}
	pSeq->size -= count;
}