C语言实现顺序表的全操作详解

typedef int SLDataType;
typedef struct SeqList
{
	SLDataType* a;
	int size;     //存储数据个数
	int capacity; //容量空间大小
}SeqList;

void SeqListInit(SeqList* ps);
void SeqListInit(SeqList* ps)
{
	assert(ps); //检查指针的有效性
	ps->a = NULL; //不知道开多大的空间，就先赋值NULL
	ps->capacity = ps->size = 0;
}

STDataType*tmp=(STDataType*)malloc(sizeof(SeqList)*2);

//检查空间，如果满了，就进行增容
void SeqListCheckCapacity(SeqList* ps);
void SeqListCheckCapacity(SeqList* ps)
{
	assert(ps);
	if (ps->capacity == ps->size)
	{
		size_t newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		SLDataType* tmp = realloc(ps->a, sizeof(SLDataType) * newcapacity);
		if (tmp == NULL)
		{
			printf("CheckCapacity::%s\n", strerror(errno));//若空间开辟失败，则打印开辟失败的原因
			exit(-1);//若空间开辟失败，则直接终止程序
		}
		else
		{
			ps->a = tmp;
			ps->capacity = newcapacity;
		}
	}
}

//顺序表打印
void SeqListPrint(SeqList* ps);
void SeqListPrint(SeqList* ps)
{
	assert(ps);
	for (int i = 0;i < ps->size;++i)//依次遍历，打印出每一个信息
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}

//顺序表尾插
void SeqListPushBack(SeqList* ps, SLDataType x);
void SeqListPushBack(SeqList* ps, SLDataType x)
{
	assert(ps);
	SeqListCheckCapacity(ps);
	ps->a[ps->size] = x;
	ps->size++;
}

//顺序表尾删
void SeqListPopBack(SeqList* ps);
void SeqListPopBack(SeqList* ps)
{
	assert(ps);
	if (ps->size > 0)//防止尾删将数据删完了，size出现负数
	{
		ps->size--;
	}
}

//顺序表头插
void SeqListPushFront(SeqList* ps, SLDataType x);
void SeqListPushFront(SeqList* ps, SLDataType x)
{
	assert(ps);
	SeqListCheckCapacity(ps);//检查空间容量
	int end = ps->size - 1;
	while (end >= 0)
	{
		ps->a[end + 1] = ps->a[end];
		--end;
	}
	ps->a[0] = x;
	ps->size++;
}

//顺序表头删
void SeqListPopFront(SeqList* ps);
void SeqListPopFront(SeqList* ps)
{
	assert(ps);
	//依次挪动数据覆盖删除
	if (ps->size > 0)//确保有数据可删除，防止下标出现负数
	{
		int begin = 1;
		while (begin < ps->size)
		{
			ps->a[begin - 1] = ps->a[begin];
			++begin;
		}
		ps->size--;
	}
}

//顺序表在pos位置插入数据
void SeqListInsert(SeqList* ps, size_t pos, SLDataType x);
void SeqListInsert(SeqList* ps, size_t pos, SLDataType x)
{
	assert(ps);
	if (pos > ps->size)
	{
		printf("pos越界\n");
		return;
	}
	SeqListCheckCapacity(ps);
	size_t end = ps->size;
	while (end > pos)
	{
		ps->a[end] = ps->a[end - 1];
		--end;
	}
	ps->a[pos] = x;
	ps->size++;
}

int end =ps->size-1;
while(end>=(int)pos)
{
    ps->a[end+1]=ps->a[end];
    --end;
}

//顺序表删除pos位置的数据
void SeqListErase(SeqList* ps, size_t pos);
void SeqListErase(SeqList* ps, size_t pos)
{
	assert(ps);
	if (pos >= ps->size)
	{
		printf("pos越界\n");
		return;
	}
	size_t begin = pos + 1;
	while (begin < ps->size)
	{
		ps->a[begin - 1] = ps->a[begin];
		++begin;
	}
	ps->size--;
}

//顺序表查找
int SeqListFind(SeqList* ps, SLDataType x);
int SeqListFind(SeqList* ps, SLDataType x)
{
	assert(ps);
	for (int i = 0;i < ps->size;++i)
	{
		if (ps->a[i] == x)
		{
			return i;
		}
	}
	return -1;
}

//顺序表销毁
void SeqListDestroy(SeqList* ps);
void SeqListDestroy(SeqList* ps)
{
	assert(ps);
	free(ps->a);
	ps->a = NULL;
	ps->size = ps->capacity = 0;
}