第二章 线性表(实现)
顺序表(动态)
结构体
typedef struct AutoSeqList
{
SLDataType * a;
int size;
int capacity;
}SL;
接口函数
void SeqListInit(SL* ps);
void SeqListDestory(SL* ps);
void SeqLiistCheckCapacity(SL* ps);
void SeqListPushBack(SL* ps, SLDataType x);
void SeqListPoint(SL* ps);
void SeqListPopBack(SL* ps);
void SeqListPushFront(SL* ps, SLDataType x);
void SeqListPopFront(SL* ps);
int SeqListFind(SL* ps, SLDataType x);
void SeqListInsert(SL* ps, int pos, SLDataType x);
void SeqListErase(SL* ps, int pos);
初始化
void SeqListInit(SL* ps) {
ps->a = NULL;
ps->capacity = ps->size = 0;
}
销毁函数
void SeqListDestory(SL* ps) {
free(ps->a);
ps->a = NULL;
ps->size = ps->capacity = 0;
}
表的check空间函数
void SeqListCheckCapacity(SL* ps) {
if (ps->size == ps->capacity) {
int newCapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
SLDataType *tem = (SLDataType *) realloc(ps->a, newCapacity * sizeof(SLDataType));
if (tem == NULL) {
printf("realloc fail");
exit(-1);
}
ps->a = tem;
ps->capacity = newCapacity;
}
}
表的打印函数
void SeqListPoint(SL* ps) {
for (int i = 0; i < ps->size; ++i) {
printf("%d", ps->a[i]);
}
printf("\n");
}
表的尾插函数
void SeqListPushBack(SL* ps, SLDataType x) {
SeqLiistCheckCapacity(ps);
ps->a[ps->size] = x;
ps->size++;
}
表尾部删除函数
void SeqListPopBack(SL* ps) {
assert(ps->size > 0);
ps->size --;
}
表的头部插入函数
void SeqListPushFront(SL* ps, SLDataType x) {
SeqLiistCheckCapacity(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->size > 0);
int Begin = 1;
while (Begin < ps->size) {
ps->a[Begin - 1] = ps->a[Begin];
++ Begin;
}
ps->size --;
}
查找指定元素的位置
int SeqListFind(SL* ps, SLDataType x) {
for (int i = 0; i < ps->size; i++) {
if (ps->a[i] == x) {
return i;
}
}
return -1;
}
指定位置插入元素
void SeqListInsert(SL* ps, int pos, SLDataType x) {
assert(pos >= 0 && pos <= ps->size);
SeqListCheckCapacity(ps);
for (int i = pos; i <= ps->size; i++ ) {
ps->a[i + 1] = ps->a[i];
}
ps->a[pos] = x;
ps->size ++;
}
指定位置删除元素
void SeqListErase(SL* ps, int pos) {
assert(pos >= 0 && pos < ps->size);
int Begin = pos + 1;
while (Begin < ps->size) {
ps->a[Begin - 1] = ps->a[Begin];
++ Begin;
}
ps->size --;
}
到此顺序表的核心用法写完了,代码在gitee
后续第二章:线性链表