目录
接下来的日子会顺顺利利,万事胜意,生活明朗-----------林辞忧
引言
数据结构的主要含义为在内存中存储管理数据,对数据进行增删查改等操作,其中最主要的一种数据结构就是顺序表,顺序表其实是用数组来实现的,用来操作数据,接下来将详细介绍
一:顺序表的结构定义
二:顺序表的操作
1.顺序表的初始化
void SeqListInit(SeqList* ps)
{
ps->a = NULL;
ps->capacity=ps->size = 0;//0表示无数据
}
2.顺序表的销毁
void SeqListDestroy(SeqList* ps)
{
free(ps->a);
ps->a = NULL;
ps->capacity = ps->size = 0;
}
3.顺序表数据的打印
void SeqListPrint(SeqList* ps)
{
for (int i = 0; i < ps->size; i++)
{
printf("%d ",ps->a[i]);
}
printf("\n");
}
4.顺序表的尾插
void SeqListPushBack(SeqList* ps, SLDateType x)
{
if (ps->size == ps->capacity)//检查容量开辟空间
//当size==capacity时说明再插入一个数据刚好满,size++,再访问会越界,所以此时应该扩容
{
int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
SLDateType* tmp = (SLDateType*)realloc(ps->a, sizeof(SLDateType) * newcapacity);
if (tmp == NULL)
{
perror("malloc fail");
return;
}
ps->a = tmp;
ps->capacity = newcapacity;
}
ps->a[ps->size] = x;
ps->size++;
}
5.顺序表的头插
void SeqListPushFront(SeqList* ps, SLDateType x)
{
if (ps->size == ps->capacity)
{
int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
SLDateType* tmp = (SLDateType*)realloc(ps->a, sizeof(SLDateType) * newcapacity);
if (tmp == NULL)
{
perror("malloc fail");
return;
}
ps->a = tmp;
ps->capacity = newcapacity;
}
//挪动数据
for (int i = ps->size; i > 0; i--)
{
ps->a[i] = ps->a[i - 1];
}
//插入
ps->a[0] = x;
ps->size++;
}
6.顺序表的尾删
注:删除不需要特意置为0等操作,直接使其顺序表不访问该数据即可
void SeqListPopBack(SeqList* ps)
{
ps->size--;
}
7.顺序表的头删
void SeqListPopFront(SeqList* ps)
{
//挪动数据
for (int i = 0; i < ps->size - 1; i++)
{
ps->a[i] = ps->a[i + 1];
}
ps->size--;
}
8.顺序表的查找
int SeqListFind(SeqList* ps, SLDateType x)
{
for (int i = 0; i < ps->size; i++)
{
if (ps->a[i] == x)
{
return i;
}
}
return 0;
}
9.顺序表的删除pos位置的值
void SeqListErase(SeqList* ps, int pos)
{
for (int i = pos; i < ps->size - 1; i++)
{
ps->a[i] = ps->a[i + 1];
}
ps->size--;
}
10.顺序表的在pos位置插入数据
void SeqListInsert(SeqList* ps, int pos, SLDateType x)
{
if (ps->size == ps->capacity)
{
int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
SLDateType* tmp = (SLDateType*)realloc(ps->a, sizeof(SLDateType) * newcapacity);
if (tmp == NULL)
{
perror("malloc fail");
return;
}
ps->a = tmp;
ps->capacity = newcapacity;
}
for (int i = ps->size; i > pos; i--)
{
ps->a[i] = ps->a[i - 1];
}
ps->a[pos] = x;
ps->size++;
}
三:总结
顺序表是属于线性表的一种,从上面可以看出关于顺序表的头删,头删效率高,对于其他需要挪动数据的操作就略显疲惫了,并且开辟的空间可能会造成浪费,但顺序表的优势在于下标的随机访问,物理空间连续命中率高