数据结构从入门到精通-顺序表

#include"text.h" void SLCheckCapacity(SL* p) { SL* a; assert(p); int Datacapaity = 0; if (p->size == p->capacity) { Datacapaity = 0 ? 4 : 2 * p->capacity; a = (DataType*)realloc(p->arr, Datacapaity * sizeof(DataType)); assert(a); p->arr = a; } p->capacity = Datacapaity; } void SLInit(SL* p) { p->arr = NULL; p->capacity = 0; p->size = 0; } void SLDestroy(SL* p) { int i = 0; for (i = 0; i < p->size; i++) { free(p->arr[i]); } SLInit(p); } void SLprint(SL p) { for (int i = 0; i < p.size; i++) { printf("%5d", p.arr[i]); } printf("\n"); } void SLPushBack(SL* p, DataType x) { assert(p); SLCheckCapacity(p); p->arr[p->size++] = x; } void SLPushFront(SL* p, DataType x) { assert(p); SLCheckCapacity(p); for (int i = p->size; i > 0; i--) { p->arr[i] = p->arr[i - 1]; } p->arr[0] = x; p->size++; } void SLPopBack(SL* p) { assert(p); assert(p->size); p->size--; } void SLPopFront(SL* p) { assert(p); assert(p->size); for (int i = 0; i < p->size - 1; i++) { p->arr[i] = p->arr[i + 1]; } p->size--; } void SLInsert(SL* p, int pos, DataType x) { assert(p); assert(pos>=0 && pos <= p->size); SLCheckCapacity(p); for (int i = p->size; i >= pos; i--) { p->arr[i] = p->arr[i - 1]; } p->arr[pos] = x; p->size++; } void SLErase(SL* p, int pos) { assert(p); assert(pos >= 0 && pos <= p->size); for (int i = pos - 1; i < p->size; i++) { p->arr[i] = p->arr[i + 1]; } p->size--; }