【数据结构】顺序表的动态存储

SeqList.h

#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
//这个头文件是用来声明函数和接口的

typedef int SLDataType;

typedef struct SeqList
{
	SLDataType* a;//
	int size;      //有效数据的个数
	int capacity; //容量
}SL,SeqList;


//初始化的接口声明
void SeqListInit(SL* ps);//SL类型的指针ps来接收s的地址
void SeqListPrint(SL* ps);
void SeqListCheckCapacity(SL* ps);
void SeqListDestory(SL* ps);


//尾插尾删  头插头删
void SeqListPushBack(SL* ps,SLDataType x);
void seqListPopBack(SL* ps);
void SeqListPushFront(SL* ps, SLDataType x);
void SeqListPopFront(SL* ps);

//任意位置的插入删除
void SeqListInsert(SL* ps, int pos, SLDataType x);
void SeqListErase(SL* ps, int pos);


//顺序表的查找
int SeqListSearch(SL* ps, SLDataType x);

.
.
.
.
SeqList.c

#include "SeqList.h"

//函数的定义
void SeqListDestory(SL* ps)
{
	free(ps->a);
	ps->a = NULL;
	ps->size = ps->capacity = 0;
}
void SeqListInit(SL* ps)
{
	ps->a = (SLDataType*)malloc(sizeof(SLDataType) * 4);
	if (ps->a == NULL)
	{
		printf("申请内存失败\n");
		exit(-1);
	}
	ps->size = 0;
	ps->capacity = 4;
}

//顺序表增容
void SeqListCheckCapacity(SL* ps)
{
	if (ps->size >= ps->capacity)
	{
		ps->capacity *= 2;
		ps->a = (SLDataType*)realloc(ps->a, sizeof
		(SLDataType) *ps->capacity);
		if(ps->a == NULL)
		{
			printf("扩容失败！");
			exit(-1);
		}
	}
}

void SeqListPrint(SL* ps)
{
	for (int i = 0; i < ps->size; i++)//前闭后开循环size次
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}

//尾插尾删  头插头删
void SeqListPushBack(SL* ps, SLDataType x)
{
	assert(ps);
	SeqListCheckCapacity(ps);

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

}

void seqListPopBack(SL* ps)
{
	assert(ps);
	ps->size--;
}

void SeqListPushFront(SL* ps, SLDataType x)
{
	assert(ps);
	SeqListCheckCapacity(ps);
	int end = ps->size - 1;
	while (end>=0)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[0] = x;
	ps->size++;
}
void SeqListPopFront(SL* ps)
{
	assert(ps);
	int start = 0;
	while (start<ps->size-1)
	{
		ps->a[start] = ps->a[start + 1];
		start++;
	}
	ps->size--;
}

//任意位置的插入删除
void SeqListInsert(SL* ps, int pos, SLDataType x)
{
	assert(ps);
	assert(pos < ps->size&& pos >= 0);
	SeqListCheckCapacity(ps);
	int end = ps->size - 1;
	while (end>=pos)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[pos-1] = x;
	ps->size++;
}
void SeqListErase(SL* ps, int pos)
{
	assert(ps);
	assert(pos <= ps->size && pos >= 0);
	int start = pos-1;
	while (start<ps->size-1)
	{
		ps->a[start] = ps->a[start + 1];
		start++;
	}
	ps->size--;//逻辑上删除该值
}

int SeqListSearch(SL* ps, SLDataType x)
{
	assert(ps);
	int i = 0;
	while (i < ps->size)
	{
		if (ps->a[i] == x)
			return i + 1;
		i++;
	}
	return -1;

}

.
.
.
.
.
.
test.c

#include "SeqList.h"

//测试
void TestSeqList1()
{
	SeqList s;
	SeqListInit(&s);
	//初始化
	SeqListPushBack(&s, 1);
	SeqListPushBack(&s, 2);
	SeqListPushBack(&s, 3);
	SeqListPushBack(&s, 4);
	SeqListPushBack(&s, 5);
	SeqListPrint(&s);

	seqListPopBack(&s);
	seqListPopBack(&s);
	SeqListPrint(&s);//虽然这里传结构体也行，但会压栈

	SeqListPushFront(&s, 0);
	SeqListPushFront(&s, 0);
	SeqListPushFront(&s, 0);
	SeqListPrint(&s);

	SeqListInsert(&s, 2, 520);
	SeqListPrint(&s);

	SeqListErase(&s, 2);
	SeqListPrint(&s);

	int pos=SeqListSearch(&s, 2);
	if (pos != -1)
	{
		SeqListErase(&s, pos);
	}
	SeqListPrint(&s);

	SeqListDestory(&s);


}



int  main()
{

	TestSeqList1();

	return 0;
}