顺序表 头插头删 尾插尾删

//头文件 List.h
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
typedef int data;
typedef struct SqList
{
	data* a;
	int size;
	int capacity;
}Sqlist;
//函数声明
void Listinit(Sqlist* ps);  //初始化、开辟内存
void Listprint(Sqlist* ps); //打印
void Listcheckcapacity(Sqlist* ps); //检查容量
void ListPushback(Sqlist* ps, data x); //尾插
void ListPopback(Sqlist* ps); //尾删
void ListPushHead(Sqlist* ps,data x); //头插
void ListPopHead(Sqlist* ps); //头删
void Listmemory(Sqlist* ps); //内存释放

// 实现模块 List.c
#include "List.h"
void Listinit(Sqlist* ps) //初始化、开辟内存
{
	ps->a = (data*)malloc(sizeof(data) * 4);
	if (ps->a == NULL)
	{
		return;
	}
	else
	{
		ps->size = 0;
		ps->capacity = 4;
	}
}
void Listprint(Sqlist* ps) //打印
{
	int i = 0;
	assert(ps);
	for (i = 0; i < ps->size; i++)
	{
		printf("%d ",ps->a[i]);
	}
	printf("\n");
}
void Listcheckcapacity(Sqlist* ps) //检查容量、增容
{
	if (ps->size >= ps->capacity)
	{
		ps->capacity *= 2; //2倍增容
		ps->a = (data*)realloc(ps->a, sizeof(data)*ps->capacity);
		if (ps == NULL)
		{
			printf("增容失败\n");
		}
	}
}
void ListPushback(Sqlist* ps, data x) //尾插
{
	assert(ps);
	Listcheckcapacity(ps); //满了增容
	ps->a[ps->size] = x;
	ps->size++;
}
void ListPopback(Sqlist* ps) //尾删
{
	assert(ps);
	ps->size--;
}
void ListPushHead(Sqlist* ps, data x) //头插  只能从最后面依次往后挪
{
	assert(ps);
	Listcheckcapacity(ps);
	int end = 0;
	end = ps->size - 1;
	while (end >= 0)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[0] = x;
	ps->size++;
}
void ListPopHead(Sqlist* ps) //头删 从后往前挪把第一个就覆盖了
{
	assert(ps->size > 0);
	int start = 1;
	while (start < ps->size)
	{
		ps->a[start - 1] = ps->a[start];
		start++;
	}
	ps->size--;
}
void Listmemory(Sqlist* ps) //内存释放
{
	free(ps->a);
	ps->a = NULL;
}

//主函数模块 main.c
#include "List.h"
void seqlist()
{
	Sqlist s;
	Listinit(&s); //初始化
	ListPushback(&s, 1); //尾插
	ListPushback(&s, 2);
	ListPushback(&s, 3);
	ListPushback(&s, 4);
	Listprint(&s); //打印
	ListPopHead(&s); //头删
	Listprint(&s); //打印
	ListPopback(&s); //尾删
	Listprint(&s); //打印
	ListPushHead(&s, 1); //头插
	Listprint(&s); //打印
}
int main()
{
	seqlist();
	return 0;
}