c语言顺序表的实现和各个功能（增删查改）

头文件

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
typedef int SLDataType;//重新将变量命名，方便以后修改
typedef struct sl
{
     SLDataType * arr;
     SLDataType size; //当前存储数量
     SLDataType capacity;//最大存储数量
}   SL; //动态顺序表初始化


void seqlistprintf(SL* ps);//打印顺序表
void seqlistinit(SL* ps);//初始化顺序表
void seqlistdestroy(SL* ps);//销毁顺序表
void seqlistcheckcapacity(SL* ps);//，检查内存情况，如果不够开辟空间和扩容
void seqlistpushback(SL* ps, int x);//尾部插入数据
void seqlistpopback(SL* ps);//尾部删除数据
void seqlistpopfront(SL* ps);//尾部插入数据
void seqlistpushfront(SL* ps,int x);//头部插入数据
void seqlistinsert(SL* ps, int pos,int x);//在下标前插入一个数据;
void seqlistfind(SL* ps, int x);//查找一个数据返回下标;
void seqlistdelinsert(SL* ps, int x);//删除一个下标

函数接口

#include"TlList.h"

void seqlistinit(SL* ps)//顺序表初始化
{
	ps->arr = NULL;
	ps->size = 0;
	ps->capacity = 0;

}
void seqlistdestroy(SL* ps)//销毁顺序表
{
	free(ps->arr);
	ps=NULL;

}
void seqlistprintf(SL* ps)//打印顺序表
{
	SLDataType i = 0;
	for (i = 0; i < ps->size; i++)
	{
		printf("%d", ps->arr[i]);
	}
	printf("\n");

}
void seqlistcheckcapacity(SL* ps)//检查内存情况，如果不够开辟空间和扩容
{
	if (ps->size == ps->capacity)
	{
		int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		int* prt = (int*)realloc(ps->arr, newcapacity * sizeof(int));
		if (prt == NULL)//如果开辟不成功
		{
			printf("realloc fail");
			exit(-1);
		}
			ps->arr = prt;
			ps->capacity = newcapacity;
	}
}
void seqlistpushback(SL* ps, int x)//尾部插入数据
{
	seqlistcheckcapacity(ps);
	ps->arr [ps->size]= x;
	
	ps->size++;
}
void seqlistpopback(SL* ps)//尾部删除数据
{
	assert(ps->size != 0);
	ps->size--;
}
void seqlistpopfront(SL* ps)//头部删除
{
	assert(ps->size != 0);
	int i = 0;
	for (i = 0; i < ps->size-1; i++)
	{
		ps->arr[i] = ps->arr[i+1];
			ps->size--;
	}
}
void seqlistpushfront(SL* ps,int x)//头部插入数据
{
	 seqlistcheckcapacity(ps);
	 ps->size++;
	 int i = 0;
	 for (i = ps->size-1; i >0; i--)
	 {
		 ps->arr[i] = ps->arr[i - 1];
		 ps->arr[0] = x;
	 }
}
void seqlistfind(SL* ps, int x)
{
	int i = 0;
	for (i = 0; i < ps->size; i++);
	{
		if (ps->arr[i] == x)
			return i;
	}
	printf("未找到此数据");

}
void seqlistinsert(SL* ps, int pos,int x)    //在指定下标前插入
{
	assert(pos >= 0 && pos < ps->size);
	seqlistcheckcapacity(ps);
	ps->size++;
	int i = 0;
	for (i = ps->size-1; i > pos; i--)
	{

		ps->arr[i] = ps->arr[i- 1];
		

	}
	ps->arr[pos] = x;
}
void seqlistdelinsert(SL* ps, int pos)//删除指定下标；
{
	assert(pos>= 0 && pos <=ps->size - 1);
	int i = 0;
	for (i = pos; i < ps->size-1; i++)
	{
		ps->arr[i] = ps->arr[i + 1];

	}
	ps->size--;


}

测试

#include"TlList.h"
void test()
{ 
	SL ps;
	seqlistinit(&ps);
	seqlistpushback(&ps,2);
	seqlistprintf(&ps);
	seqlistpushback(&ps, 3);
	seqlistpushback(&ps, 3);
	 seqlistdelinsert(&ps, 1);
	 seqlistdelinsert(&ps, 1);
	seqlistprintf(&ps);
	seqlistdestroy(&ps); 
}
menu()
{
	printf("---------------------------------\n");
	printf("---------------------------------\n");
	printf("1、头插        2、头删\n");
	printf("3、尾插        4、尾删\n");
	printf("5、插入        4、插入删除\n");



}
int main()
{
	
test();
	return 0;
}