顺序表的增删查改

1、头文件

#pragma once

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>

typedef int SLDateType;
typedef struct SeqList
{
	SLDateType* a;//对应数据类型的指针，用来指向动态开辟的空间
	int size;//记录当前有效数据的个数
	int capacity;//当前容量
}SeqList;


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

//初始化顺序表
void SeqListInit(SeqList* ps);
//顺序表的销毁
void SeqListDestroy(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, int pos, SLDateType x);
// 顺序表删除pos位置的值
void SeqListErase(SeqList* ps, int pos);

 2、对应函数实现

#define _CRT_SECURE_NO_WARNINGS 1

#include "SeqList.h"

//初始化顺序表
void SeqListInit(SeqList* ps)
{
	assert(ps);
	ps->a = (SLDateType*)malloc(sizeof(SLDateType) * 4);
	if (ps->a == NULL)
	{
		perror("malloc fail");
		return;
	}
	ps->capacity = 4;
	ps->size = 0;
}

//顺序表的销毁
void SeqListDestroy(SeqList* ps)
{
	assert(ps);//断言：防止ps为空
	free(ps->a);//释放（避免内存泄漏）
	ps->a = NULL;//置空（避免野指针）
	ps->capacity = 0;
	ps->size = 0;
}

//顺序表的打印
void SeqListPrint(SeqList* ps)
{
	for (int i = 0; i < ps->size; i++)
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}

//检测容量，是否扩容
void SeqListCheckCapacity(SeqList* ps)
{
	assert(ps);
	if (ps->size == ps->capacity)
	{
		SLDateType* tmp = (SLDateType*)realloc(ps->a, sizeof(SLDateType)*ps->capacity * 2);
		if (tmp == NULL)
		{
			perror("realloc fail");
			return;
		}
		ps->a = tmp;
		ps->capacity *= 2;
	}
}

//顺序表的尾插
void SeqListPushBack(SeqList* ps, SLDateType x)
{
	
	SeqListCheckCapacity(ps);//检测容量

	//ps->a[ps->size] = x;
	//ps->size++;
	ps->a[ps->size++] = x;
}

//顺序表的头插
void SeqListPushFront(SeqList* ps, SLDateType x)
{
	SeqListCheckCapacity(ps);//检测容量
	//从后往前将数据整体向后移
	for (int i = ps->size - 1; i >= 0; i--)
	{
		ps->a[i + 1] = ps->a[i];
	}
	ps->a[0] = x;//将插入数据放在头部
	ps->size++;
}

//顺序表的头删
void SeqListPopFront(SeqList* ps)
{
	assert(ps);
	assert(ps->size);//防止空表删除
	//将表中的数据依次前移，覆盖第一个数据
	//循环size-1次
	for (int i = 0; i < ps->size-1; i++)
	{
		ps->a[i] = ps->a[i + 1];
	}
	ps->size--;
}

//顺序表的尾删
void SeqListPopBack(SeqList* ps)
{
	assert(ps);
	assert(ps->size);//防止空表删除
	ps->size--;//直接有效数据减一，下次插入覆盖原数据
}

//顺序表查找,找到返回下标
int SeqListFind(SeqList* ps, SLDateType x)
{
	assert(ps);

	for (int i = 0; i < ps->size; i++)
	{
		if (x == ps->a[i])
			return i;
	}
	return -1;//没有找到
}

//顺序表在pos位置插入x, pos是下标
void SeqListInsert(SeqList* ps, int pos, SLDateType x)
{
	assert(ps);
	assert(pos <= ps->size);//pos要在有效数据内
	SeqListCheckCapacity(ps);//检测容量
	//由后向前将pos即后面的数据依次向后移动一位
	for (int i = ps->size; i >= pos; i--)
	{
		ps->a[i] = ps->a[i - 1];
	}
	ps->a[pos] = x;
	ps->size++;
}

// 顺序表删除pos位置的值, pos是下标
void SeqListErase(SeqList* ps, int pos)
{
	assert(ps);
	assert(pos < ps->size);//pos要在有效数据内
	//依次将pos即后面的数据向前移动一位，覆盖掉pos的原数据
	for (int i = pos; i < ps->size - 1; i++)
	{
		ps->a[i] = ps->a[i + 1];
	}
	ps->size--;
}

3、测试

#define _CRT_SECURE_NO_WARNINGS 1

#include "SeqList.h"

int main()
{
	SeqList ps;
	SeqListInit(&ps);
	SeqListPushBack(&ps, 1);
	SeqListPushBack(&ps, 2);
	SeqListPushBack(&ps, 3);
	SeqListPushBack(&ps, 4);
	SeqListPushBack(&ps, 5);
	SeqListPushBack(&ps, 6);
	SeqListPrint(&ps);
	SeqListPopBack(&ps);

	SeqListPushFront(&ps, 7);
	SeqListPushFront(&ps, 12);
	SeqListPrint(&ps);
	SeqListPopFront(&ps);
	SeqListPrint(&ps);

	SeqListInsert(&ps, 3, 5);
	SeqListPrint(&ps);
	SeqListErase(&ps, 5);
	SeqListPrint(&ps);

	SeqListDestroy(&ps);

	return 0;
}

3.1 测试运行结果