数据结构之定长顺序表（C语言）

头文件seqlist.h

#define SIZE 10

typedef struct Seqlist
{
	int elem[SIZE];//存放数据
	int count;    //有效数据的个数
}Seqlist, * SeqList;


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

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

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

//判空
bool IsEmpty(SeqList plist);

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

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

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

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

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

功能函数的具体实现（seqlist.cpp）

#include "seqlist.h"
#include <assert.h>
#include <stdio.h>

/*初始化函数*/
void InitSeqList(SeqList plist)
{
	assert(plist != NULL);
	if (plist == NULL)
		return;

	//plist->elem;
	plist->count = 0;//当前还没有有效数据
}

/*判满*/
static bool IsFull(SeqList plist)
{
	return plist->count == SIZE;
}

/*往plist的pos位置插入数据val*/
bool Insert(SeqList plist, int val, int pos)
{
	assert(plist != NULL);
	if (pos<0 || pos>plist->count || IsFull(plist))//数据必须靠左,连续存放(当前设计决定)
	{
		return false;
	}

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

	//在pos位置插入数据
	plist->elem[pos] = val;

	//有效数据个数增加
	plist->count++;

	return true;
}

/*在plist中查找关键字key,找到返回下标,失败返回-1*/
int Search(SeqList 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(SeqList plist)
{
	return plist->count == 0;
}

/*删除plist中的第一个key*/
bool DeleteVal(SeqList plist, int key)
{
	/*int i=Search(plist, key);//找到key的位置
	DeletePos(plist, i);//删除*/

	//上面两句可以合并为下面一句
	return DeletePos(plist, Search(plist, key));
}

/*删除plist中pos位置的值*/
bool DeletePos(SeqList plist, int pos)
{
	assert(plist != NULL);

	//pos的合理范围是0-->plist->count-1
	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;
}

/*将pos位置的值赋值成newVal*/
bool SetPos(SeqList plist, int pos, int newVal)
{
	assert(plist != NULL);
	if (pos < 0 || pos >= plist->count)
	{
		return false;
	}
	plist->elem[pos] = newVal;
	return true;
}

/*输出所有数据*/
void Show(SeqList plist)
{
	for (int i = 0; i < plist->count; i++)
	{
		printf("%d ", plist->elem[i]);
	}
	printf("\n");
}

/*清空数据*/
void Clear(SeqList plist)
{
	plist->count = 0;
}