#include
#include
#include
#include
#include
typedef int DateType;
typedef struct SeqList
{
DateType *arr;
size_t capacility;
size_t size;
}SeqList;
//创建空间
void CheckCapa(SeqList *Seq)
{
assert(Seq);
if (Seq->size >= Seq->capacility)
{
Seq->capacility = 2 * Seq->capacility + 3;
Seq->arr = (DateType*)realloc(Seq->arr, Seq->capacility * sizeof(DateType));
}
}
//初始化动态顺序表
void initSeqList(SeqList *Seq)
{
Seq->arr = NULL/* malloc(sizeof(DateType) * 3)*/;
Seq->capacility = 0;
Seq->size = 0;
}
//销毁空间
void DestroySeq(SeqList *Seq)
{
Seq->capacility = 0;
Seq->size = 0;
free(Seq->arr);
Seq->arr = NULL;
}
//尾插
void PushBack(SeqList *Seq,DateType x)
{
assert(Seq);
CheckCapa(Seq);
Seq->arr[Seq->size++] = x;
}
//尾删
void PopBack(SeqList *Seq)
{
assert(Seq);
if (Seq->size <= 0)
{
printf(“当前顺序表为空！无法继续删除\n”);
return;
}
–Seq->size;
printf(“\n”);
}
//打印动态顺序表
void PrintSeq(SeqList *Seq)
{
assert(Seq);
int index = 0;
if (Seq->size == 0)
{
printf(“当前顺序表为空！\n”);
return;
}
for (index = 0; index size; index++)
{
printf(“%d->”, Seq->arr[index]);
}
printf(“\n”);
}
void Test()
{
SeqList Seq;
initSeqList(&Seq);
PushBack(&Seq,1);
PushBack(&Seq, 2);
PushBack(&Seq, 3);
PushBack(&Seq, 4);
PrintSeq(&Seq);
PopBack(&Seq);
PrintSeq(&Seq);
DestroySeq(&Seq);
}
int main()
{
Test();
system(“pause”);
return 0;
}
原文：http://.blog.51cto.com//
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/215022.html原文链接：https://javaforall.net
