顺序表的实现

顺序表的实现

头文件

#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
typedef int SLDataType;
typedef struct SeqList
{
	SLDataType* array; // 指向动态开辟的数组
	size_t size;    // 有效数据个数
	size_t capicity;  // 容量空间的大小
}SeqList;

// 基本增删查改接口
// 顺序表初始化
void SeqListInit(SeqList* psl, size_t capacity);
// 顺序表销毁
void SeqListDestory(SeqList* psl);
// 顺序表打印
void SeqListPrint(SeqList* psl);
// 检查空间，如果满了，进行增容
void CheckCapacity(SeqList* psl);
//顺序表尾插
void SeqListPushBack(SeqList* psl, SLDataType x);
//顺序表尾删
void SeqListPopBack(SeqList* psl);
//顺序表头插
void SeqListPushFront(SeqList* psl, SLDataType x);
// 顺序表头删
void SeqListPopFront(SeqList* psl);
//顺序表查找
int SeqListFind(SeqList* psl, SLDataType x);
//顺序表在pos位置插入x
void SeqListInsert(SeqList* psl, size_t pos, SLDataType x);
//顺序表删除pos位置的值
void SeqListErase(SeqList* psl, size_t pos);

主文件

#define _CRT_SECURE_NO_WARNINGS 1
#include "ds.h"
// 顺序表初始化
void SeqListInit(SeqList* psl, size_t capacity)
{
	psl->size = 0;
	psl->array = (SeqList*)malloc(sizeof(SeqList) * capacity);
	psl->capicity = capacity;
}
// 顺序表销毁
void SeqListDestory(SeqList* psl)
{
	psl->size = 0;
	psl->capicity = 0;
	free(psl->array);
	psl->array = NULL;
}
// 顺序表打印
void SeqListPrint(SeqList* psl)
{
	for (size_t i = 0; i < psl->size; i++)
	{
		printf("%d\n", psl->array[i]);
	}
}
// 检查空间，如果满了，进行增容
void CheckCapacity(SeqList* psl)
{
	if (psl->size == psl->capicity)
	{
		size_t newcapicity = psl->capicity < 0 ? 2 : psl->capicity * 2;
		psl->array = (SeqList*)realloc(0, sizeof(SeqList)*newcapicity);
		psl->capicity = newcapicity;
	}
}
// 顺序表尾插
void SeqListPushBack(SeqList* psl, SLDataType x)
{
	CheckCapacity(psl);
	psl->array[psl->size] = x;
	psl->size++;
}
// 顺序表尾删
void SeqListPopBack(SeqList* psl)
{
	if (psl->size != 0)
	{
		psl->size--;
	}
}
// 顺序表头插
void SeqListPushFront(SeqList* psl, SLDataType x)
{
	CheckCapacity(psl);
	for (size_t i = psl->size; i > 0; i--)
	{
		psl->array[i] = psl->array[i - 1];
	}
	psl->array[0] = x;
	psl->size++;
}
// 顺序表头删
void SeqListPopFront(SeqList* psl)
{
	if (psl->size != 0)
	{
		for (size_t i = 0; i < psl->size - 1; i++)
		{
			psl->array[i] = psl->array[i + 1];
		}
		psl->size--;
	}
}
// 顺序表查找
int SeqListFind(SeqList* psl, SLDataType x)
{
	for (size_t i = 0; i < psl->size; i++)
	{
		if (psl->array[i] == x)
		{
			return i;
		}
	}
	return -1;
}
// 顺序表在pos位置插入x
void SeqListInsert(SeqList* psl, size_t pos, SLDataType x)
{
	if (psl->size < pos)
	{
		return;
	}
	CheckCapacity(psl);
	for (size_t i = psl->size; i > pos; i--)
	{
		psl->array[i] = psl->array[i - 1];
	}
	psl->array[pos] = x;
	psl->size++;
}
// 顺序表删除pos位置的值
void SeqListErase(SeqList* psl, size_t pos)
{
	if (psl->size < pos)
	{
		return;
	}
	for (size_t i = pos; i < psl->size - 1; i++)
	{
		psl->array[i] = psl->array[i + 1];
	}
	psl->size--;
}

测试文件

#define _CRT_SECURE_NO_WARNINGS 1	
#include "ds.h"

int main()
{
	SeqList a;
	SeqListInit(&a, 10);
	SeqListPushBack(&a, 0);
	SeqListPushBack(&a, 1);
	SeqListPushBack(&a, 2);
	SeqListPushBack(&a, 3);
	SeqListPushFront(&a, 0);
	SeqListPopFront(&a);
	SeqListPopBack(&a);
	SeqListInsert(&a, 1, 50);
	SeqListErase(&a, 0);
	SeqListPrint(&a);
	SeqListDestory(&a);
	return 0;
}

来源：CSDN

作者：Mrsw

链接：https://blog.csdn.net/weixin_43554618/article/details/103723017