顺序表实现

//SeqList.h
#pragma once

#include <stdio.h>
typedef int SLDateType;
typedef struct SeqList
{
	SLDateType* a;
	size_t size;
	size_t capacity; // unsigned int
}SeqList;

// 对数据的管理:增删查改 
void SeqListInit(SeqList* ps);
void SeqListDestory(SeqList* ps);

void SeqListPrint(SeqList* ps);
void SeqListPushBack(SeqList* ps, SLDateType x);
void SeqListPushFront(SeqList* ps, SLDateType x);
void SeqListPopFront(SeqList* ps);
void SeqListPopBack(SeqList* ps);

// 顺序表查找
int SeqListFind(SeqList* ps, SLDateType x);
// 顺序表在pos位置插入x
void SeqListInsert(SeqList* ps, size_t pos, SLDateType x);
// 顺序表删除pos位置的值
void SeqListErase(SeqList* ps, size_t pos);

//SeqList.c
#include <stdio.h>
#include <malloc.h>
#include <string.h>
#include <assert.h>
#include "SeqList.h"

#if 0
typedef int SLDateType;
typedef struct SeqList
{
	SLDateType* a;
	size_t size;
	size_t capacity; // unsigned int
}SeqList;
#endif

// 对数据的管理:增删查改 

//顺序表创建
void SeqListInit(SeqList* ps)
{
	assert(NULL != ps);

	ps->a = (SLDateType*)malloc(sizeof(SLDateType)* 10);
	ps->capacity = 10;
	ps->size = 0;
}
//顺序表销毁
void SeqListDestory(SeqList* ps)
{
	assert(NULL != ps);

	free(ps->a);
	ps->capacity = 0;
	ps->size = 0;
}
//顺序表打印
void SeqListPrint(SeqList* ps)
{
	assert(NULL != ps);

	for (int i = 0; i < ps->size; i++)
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}


//扩容
void CheckCacpity(SeqList* ps)
{
	if (ps->capacity == ps->size)
	{
		ps->a = (SLDateType*)realloc(ps->a, sizeof(SLDateType)* ps->capacity * 2);
		ps->capacity *= 2;
	}
}

//顺序表尾插
void SeqListPushBack(SeqList* ps, SLDateType x)
{
	assert(NULL != ps);
	CheckCacpity(ps);
	
	ps->a[ps->size] = x;
	ps->size++;
}
//头插
void SeqListPushFront(SeqList* ps, SLDateType x)
{
	assert(NULL != ps);
	CheckCacpity(ps);

	memmove(ps->a + 1, ps->a, sizeof(SLDateType)* ps->size++);
	ps->a[0] = x;
}
//头删
void SeqListPopFront(SeqList* ps)
{
	assert(NULL != ps);
	if (0 == ps->size)
	{
		return;
	}

	memmove(ps->a, ps->a + 1, sizeof(SLDateType)* (--ps->size));
}
//尾删
void SeqListPopBack(SeqList* ps)
{
	assert(NULL != ps);
	if (0 == ps->size)
	{
		return;
	}

	ps->size--;
}


// 顺序表查找
int SeqListFind(SeqList* ps, SLDateType x)
{
	assert(NULL != ps);

	for (int i = 0; i < ps->size; i++)
	{
		if (ps->a[i] == x)
		{
			return i;
		}
	}
	return -1;
}
// 顺序表在pos位置插入x
void SeqListInsert(SeqList* ps, size_t pos, SLDateType x)
{
	assert(NULL != ps);
	CheckCacpity(ps);

	memmove(ps->a + pos + 1, ps->a + pos, sizeof(SLDateType)*(ps->size - pos));
	ps->a[pos] = x;
	ps->size++;
}
// 顺序表删除pos位置的值
void SeqListErase(SeqList* ps, size_t pos)
{
	assert(NULL != ps);
	CheckCacpity(ps);

	memmove(ps->a + pos, ps->a + pos + 1, sizeof(SLDateType)*(ps->size - pos));
	ps->size--;
}