数据结构之不定长顺序表

Dseqlist.h文件

typedef struct Seqlist
{
	int *elem;    //指向数据元素的指针
	int count;    //有效数据的个数
	int lenth = 0;//总长度
}DseqList, * DSeqList;


//初始化函数
void InitSeqList(DSeqList plist);

//往plist的pos位置插入数据val
bool Insert(DSeqList plist, int val, int pos);

//在plist中查找关键字key,找到返回下标,失败返回-1
int Search(DSeqList plist, int key);

//判空
bool IsEmpty(DSeqList plist);

//删除plist中的第一个key
bool DeleteVal(DSeqList plist, int key);

//删除plist中pos位置的值
bool DeletePos(DSeqList plist, int pos);

//将pos位置的值赋值成newVal
bool SetPos(DSeqList plist, int pos, int newVal);

//得到有效数据个数
int GetCount(DSeqList plist);

//获取pos位置的值
int GetElem(DSeqList plist, int pos);

//输出所有数据
void Show(DSeqList plist);

//清空数据
void Clear(DSeqList plist);

//销毁动态内存
void Destroy(DSeqList plist);

//逆置
void Reserve(DSeqList plist);

Dseqlist.cpp文件

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include"Dseqlist.h"
#define INIT_SIZE 10 //初始长度


/*初始化函数*/
void InitSeqList(DSeqList plist)
{
	assert(plist != NULL);
	if (plist == NULL)
		return;
	plist->elem = (int*)malloc(sizeof(int) * INIT_SIZE);
	plist->count = 0;
	plist->lenth = INIT_SIZE;
}
/*判满*/
static bool Is_Full(DSeqList plist)
{
	assert(plist != NULL);
	return plist->count == plist->lenth;
}

/*将容量扩大到原来的2倍*/
static bool Inc(DSeqList plist)
{
	assert(plist != NULL);
	plist->elem = (int*)realloc(plist->elem,sizeof(int) * plist->lenth * 2);
	plist->lenth *= 2;
	return true;
}

/*往plist的pos位置插入数据val*/
bool Insert(DSeqList plist, int val, int pos)
{
	assert(plist != NULL);
	//检查参数合法性
	if (pos<0 || pos>plist->count)
	{
		return false;
	}

	if (Is_Full(plist))
	{
		Inc(plist);//扩容
	}

	//往后移数据
	for (int i = plist->count - 1; i >= pos; --i)
	{
		plist->elem[i + 1] = plist->elem[i];
	}

	//插入新数据
	plist->elem[pos] = val;

	//有效长度++
	plist->count++;

	return true;
}

/*在plist中查找关键字key,找到返回下标,失败返回-1*/
int Search(DSeqList plist, int key)
{
	assert(plist != NULL);
	for (int i = 0; i < plist->count; ++i)
	{
		if (plist->elem[i] == key)
		{
			return i;
		}
	}
	return -1;
}

/*判空*/
bool IsEmpty(DSeqList plist)
{
	assert(plist != NULL);
	return plist->count == 0;
}

/*删除plist中pos位置的值*/
bool DeletePos(DSeqList plist, int pos)
{
	assert(plist != NULL);
	//判空
	if (IsEmpty(plist))
	{
		return false;
	}
	//检查pos的合法性
	if (pos<0 || pos>=plist->count)
	{
		return false;
	}

	//往前移数据
	for (int i = pos; i < plist->count-1; ++i)
	{
		plist->elem[i] = plist->elem[i + 1];
	}

	//有效长度--
	plist->count--;

	return true;
}

/*删除plist中的第一个key*/
bool DeleteVal(DSeqList plist, int key)
{
	assert(plist != NULL);
	return DeletePos(plist, Search(plist, key));
}

/*将pos位置的值赋值成newVal*/
bool SetPos(DSeqList plist, int pos, int newVal)
{
	assert(plist != NULL);
	//检查参数合法性
	if (pos < 0 || pos >= plist->count)
	{
		return false;
	}

	//赋值
	plist->elem[pos] = newVal;

	return true;
}

/*获取数据有效个数*/
int GetCount(DSeqList plist)
{
	assert(plist != NULL);
	return plist->count;
}

/*获取pos位置的值*/
int GetElem(DSeqList plist, int pos)
{
	assert(plist != NULL);
	return plist->elem[pos];
}

/*输出所有数据*/
void Show(DSeqList plist)
{
	assert(plist != NULL);

	for (int i = 0; i < plist->count; ++i)
	{
		printf("%d ", plist->elem[i]);
	}
	printf("\n");
}

/*清空数据*/
void Clear(DSeqList plist)
{
	assert(plist != NULL);
	plist->count = 0;
}

/*销毁动态内存*/
void Destroy(DSeqList plist)
{
	assert(plist != NULL);
	Clear(plist);
	free(plist->elem);
	plist->elem = NULL;
}

/*逆置*/
void Reserve(DSeqList plist)
{
	assert(plist != NULL);
	int tmp = 0;
	for (int i = 0, j = plist->count - 1; i < j; ++i, --j)
	{
		tmp = plist->elem[i];
		plist->elem[i] = plist->elem[j];
		plist->elem[j] = tmp;
	}
}