数据结构之顺序表的实现（含全部代码）

从今天起开始编写数据结构中各种数据结构和算法的实现
以下是顺序表的实现

//所需要的头文件#pragma once#include#include#include#include

//定义数据类型typedef int SQDataType;//创建顺序表typedef struct SList {SQDataType* a;int size;//元素个数int capacity;//容量}SL;

线性表中的顺序表的实现，主要实现函数如下

//以下是所需要实现的函数//初始化void SListInit(SL* ps);//打印void SListPrint(SL* ps);//销毁顺序表void SListDestory(SL* ps);//检查是否增容void SListCheckCapacity(SL* ps);//尾插void SListPushBack(SL* ps, SQDataType x);//头插void SListPushFront(SL* ps, SQDataType x);//尾删void SListPopBack(SL* ps);//头删void SListPopFront(SL* ps);//pos 前插入xvoid SListInsert(SL* ps, int pos, SQDataType x);//销毁pos处的元素void SListErase(SL* ps, int pos);//查找int SListFind(SL* ps, SQDataType x);//修改void SListModity(SL* ps, int pos, SQDataType x);

//函数的实现#include"SList.h"void SListInit(SL* ps){ps->a = NULL;ps->capacity = 0;ps->size = 0;}void SListPrint(SL* ps){for (int i = 0; i < ps->size; i++){printf("%d ", ps->a[i]);}printf("\n");}void SListDestory(SL* ps){free(ps->a);ps->a = NULL;ps->capacity = 0;ps->size = 0;}//检查是否增容void SListCheckCapacity(SL* ps){if (ps->size == ps->capacity){int newcapacity = ps->capacity == 0 ? 2 : ps->capacity * 2;SQDataType* tmp = (SQDataType*)realloc(ps->a, newcapacity * sizeof(SQDataType));if (tmp == NULL){printf("realloc fail\n");exit(-1);}else{ps->a = tmp;ps->capacity = newcapacity;}}}//尾插void SListPushBack(SL* ps, SQDataType x){/*SListCheckCapacity(ps);ps->a[ps->size] = x;ps->size++;*/SListInsert(ps, ps->size, x);}//头插void SListPushFront(SL* ps, SQDataType x){SListCheckCapacity(ps);int end = ps->size - 1;while(end>=0){ps->a[end + 1] = ps->a[end];end--;}ps->a[0] = x;ps->size++;//SListInsert(ps, 0, x);}//尾删void SListPopBack(SL* ps);//头删void SListPopFront(SL* ps);//pos 前插入xvoid SListInsert(SL* ps, int pos, SQDataType x){assert(pos <= ps->size);SListCheckCapacity(ps);int end = ps->size - 1;while (end >= pos){ps->a[end + 1] = ps->a[end];end--;}ps->a[pos] = x;ps->size++;}//销毁pos处的元素void SListErase(SL* ps, int pos){assert(pos < ps->size);int cur = pos + 1;while (cur<ps->size){ps->a[cur - 1] = ps->a[cur];cur++;}ps->size--;}//查找int SListFind(SL* ps, SQDataType x){for (int i = 0; i < ps->size; i++){if (ps->a[i] == x)return i;}return -1;}//修改void SListModity(SL* ps, int pos, SQDataType x){assert(pos <= ps->size - 1);ps->a[pos] = x;}

与50位技术专家面对面 20年技术见证，附赠技术全景图说说控