顺序表实现常见接口函数

注意！头插和指定位置插，挪动元素时必须从最后开始挪，否则有效元素会被覆盖！

接口声明（我命名为sqlist.h文件）：

#include <stdio.h>
#include <stdlib.h>
typedef int data_type;
typedef struct SeqList {
	data_type* a;
	int size;//当前元素个数
	int capacity;//容量
}SL;
void SeqListInit(SL* ps);//初始化顺序表
void SeqListPrint(SL* ps);//打印顺序表
void SeqListCheckCapacity(SL* ps);//检容

void SeqListPushback(SL* ps, data_type insert);//尾插
void SeqListPopback(SL* ps);//尾删
void SeqListPushfront(SL* ps, data_type insert);//头插
void SeqListPopfront(SL* ps);//头删

int SeqListFind(SL* ps, data_type find);//查找指定对象
void SeqListInsert(SL* ps, int pos, data_type insert);//指定位置插入
void SeqListErase(SL* ps, int pos);//指定位置删除

接口实现（我命名为sqlist.c文件）：

#include "sqlist.h"
void SeqListInit(SL* ps) {//初始化顺序表
	ps->a = NULL;
	ps->size = 0;
	ps->capacity = 0;
}
void SeqListPrint(SL* ps) {//打印顺序表
	for (int i = 0; i < ps->size; i++) {
		printf("%d ", ps->a[i]);
	}
}
void SeqListCheckCapacity(SL* ps) {//检查容量
	if (ps->size == ps->capacity) {//第一次插入，或者容量达到上限，反正都要扩容，通常扩当前capcity的2倍，如果是第一次的话特判
		int newcapacity = ps->size == 0 ? 4 : 2 * ps->capacity;
		data_type* tmp = (data_type*)realloc(ps->a, newcapacity * sizeof(data_type));
		if (tmp == NULL) {
			perror("SeqListCheckCapacity扩容失败!");
			return;
		}
		ps->a = tmp;
		ps->capacity = newcapacity;
	}
}

void SeqListPushback(SL* ps, data_type insert) {//尾插
	/*SeqListCheckCapacity(ps);
	ps->a[ps->size] = insert;
	ps->size++;*/
	SeqListInsert(ps, ps->size, insert);
}
void SeqListPopback(SL* ps) {//尾删
	/*if (ps->size == 0) {
		printf("当前无可删除内容！\n");
		return;
	}
	ps->size--;*/
	SeqListErase(ps, ps->size);
}
void SeqListPushfront(SL* ps, data_type insert) {//头插
	/*SeqListCheckCapacity(ps);
	for (int i = ps->size - 1; i >= 0; i--) {
		ps->a[i + 1] = ps->a[i];
	}
	ps->a[0] = insert;
	ps->size++;*/
	SeqListInsert(ps, 0, insert);
}
void SeqListPopfront(SL* ps) {//头删
	/*if (ps->size == 0) {
		printf("当前无可删除内容！\n");
		return;
	}
	for (int i = 0; i < ps->size - 1; i++) {
		ps->a[i] = ps->a[i + 1];
	}
	ps->size--;*/
	SeqListErase(ps, 0);
}
int SeqListFind(SL* ps, data_type find) {//查找指定对象
	for (int i = 0; i < ps->size; i++) {
		if (ps->a[i] == find)
			return i;//找到返回下标
	}
	return -1;//否则返回-1
}
void SeqListInsert(SL* ps, int pos, data_type insert) {//指定位置插入
	SeqListCheckCapacity(ps);
	for (int i = ps->size - 1; i >= pos; i--) {
		ps->a[i + 1] = ps->a[i];
	}
	ps->a[pos] = insert;
	ps->size++;
}
void SeqListErase(SL* ps, int pos) {//指定位置删除
	if (ps->size == 0 || pos > ps->size) {
		printf("无可删除的内容!\n");
		return;
	}
	for (int i = pos; i < ps->size - 1; i++) {
		ps->a[i] = ps->a[i + 1];
	}
	ps->size--;
}turn;
	}
	for (int i = 0; i < ps->size - 1; i++) {
		ps->a[i] = ps->a[i + 1];//用覆盖的操作实现尾删
	}
	ps->size--;
}
int SeqListFind(SL* ps, data_type find) {//查找指定对象
	for (int i = 0; i < ps->size; i++) {
		if (ps->a[i] == find)
			return i;//找到返回下标
	}
	return -1;//否则返回-1
}
void SeqListInsert(SL* ps, int pos, data_type insert) {//指定位置插入
	SeqListCheckCapacity(ps);
	for (int i = ps->size - 1; i >= pos; i--) {
		ps->a[i + 1] = ps->a[i];
	}
	ps->a[pos] = insert;
	ps->size++;
}
void SeqListErase(SL* ps, int pos) {//指定位置删除
	if (pos >= ps->size) {
		printf("无可删除的内容!\n");
		return;
	}
	for (int i = pos; i < ps->size - 1; i++) {
		ps->a[i] = ps->a[i + 1];
	}
	ps->size--;
}

测试：

#include "sqlist.h"
void testSeqList1() {
	SL sl;
	SeqListInit(&sl);
	SeqListPopback(&sl);
	SeqListPushback(&sl, 1);
	SeqListPushback(&sl, 2);
	SeqListPushback(&sl, 3);
	SeqListPushback(&sl, 4);
	SeqListPushback(&sl, 5);
	SeqListPushback(&sl, 6);
	SeqListPushback(&sl, 7);

	SeqListPushfront(&sl, 10);
	SeqListPushfront(&sl, 20);
	SeqListPushfront(&sl, 30);
	SeqListPrint(&sl);
	SeqListPopback(&sl);
	SeqListPopback(&sl);
	printf("\n");
	SeqListPrint(&sl);
	SeqListPopfront(&sl);
	SeqListPopfront(&sl);
	printf("\n");
	SeqListPrint(&sl);
}
int main() {
	testSeqList1();
	return 0;
}