【数据结构初阶】--- 序次表 - ToB企服应用市场:ToB评测及商务社交产业平台

struct SeqList
* {
* int arr[20];
* int size;
* };

复制代码

typedef int SeqListType;//因为顺序表中存储的数据不见得都是int型，也可能是别的类型数据，所以,想存放别的数据时只需把int换成你想存的数据的类型
//动态顺序表
typedef struct SeqList
{
SeqListType* data;//指针指向的是SeqListType这个类型的数据
int size;//记录当前有效储存数据的个数
int capacity;//data开辟数组空间的容量
}SeqList;

复制代码

//初始化顺序表（开辟空间，赋初值）
void SLInit(SeqList* ps)
{
//开辟一块大小为sizeof(SeqListType) * 4的内存，并把首地址传给指针ps->data
ps->data = (SeqListType*)malloc(sizeof(SeqListType) * 4);
if (ps->data == NULL)
{
perror("malloc");
return;
}
ps->size = 0;
ps->capacity = 4;
}
//销毁空间，因为是在堆区开辟的数据，用完要用free函数释放
void SLDestory(SeqList* ps)
{
free(ps->data);
ps->data = NULL;
ps->size = 0;
ps->capacity = 0;
}
void SLPrint(SeqList* ps)
{
for (int i = 0; i < ps->size; i++)
{
printf("%d ", ps->data[i]);
}
printf("\n");
}

复制代码

//检查容量，不足顺便扩容
void CheckCapacity(SeqList* ps)
{
if (ps->capacity == ps->size)
{
//用realloc给ps->data开辟一个原来2倍的空间
SeqListType* new_ps = (SeqListType*)realloc(ps->data,sizeof(SeqListType)*ps->capacity * 2);
if (new_ps != NULL)//判断返是否开辟成功，若为NULL则开辟失败
{
ps->data = new_ps;
new_ps = NULL;
ps->capacity *= 2;
}
else
{
perror("realloc");
return;
}
}
}

复制代码

//头插法
void SLPushFront(SeqList* ps, SeqListType x)
{
//检查目前容量，不足就扩容
CheckCapacity(ps);
for (int i = ps->size - 1; i >= 0; i--)
{
ps->data[i + 1] = ps->data[i];
}
ps->data[0] = x;
ps->size++;
}
//尾插法
void SLPushBack(SeqList* ps, SeqListType x)
{
CheckCapacity(ps);
ps->data[ps->size] = x;
ps->size++;
}

复制代码

//头删法
void SLPopFront(SeqList* ps)
{
//这里断言的原因是，如果ps是空指针，for循环条件判断就会访问空指针
assert(ps != NULL);
//*****************当size==0时，也会执行ps->size--,后续可能会造成越界访问***************
assert(ps->size > 0);
for (int i = 1; i < ps->size; i++)
{
ps->data[i - 1] = ps->data[i];
}
ps->size--;
}
//尾删法
void SLPopBack(SeqList* ps)
{
assert(ps != NULL);
assert(ps->size > 0);
ps->size--;
}

复制代码

void SLInsert(SeqList* ps, int position, SeqListType x)
{
assert(ps != NULL);
//判断给的位置是否越界，若越界，程序执行完会告诉你这里出的问题
assert(position >= 1 && position <= ps->size);
CheckCapacity(ps);
for (int i = ps->size - 1; i >= position - 1; i--)
{
ps->data[i + 1] = ps->data[i];
}
ps->data[position - 1] = x;
ps->size++;
}

复制代码

void SLErase(SeqList* ps, int position)
{
assert(ps != NULL);
assert(position >= 1 && position <= ps->size);
assert(ps->size > 0);
for (int i = position; i < ps->size; i++)
{
ps->data[i - 1] = ps->data[i];
}
ps->size--;
}

复制代码

int SLFind(SeqList* ps, SeqListType x)
{
assert(ps != NULL);
for (int i = 0; i < ps->size; i++)
{
if (ps->data[i] == x)
return i;
}
return -1;
}

复制代码

#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
typedef int SeqListType;
//动态顺序表
typedef struct SeqList
{
SeqListType* data;
int size;
int capacity;
}SeqList;
//初始化顺序表
void SLInit(SeqList* ps);
//销毁顺序表
void SLDestory(SeqList* ps);
//打印顺序表
void SLPrint(SeqList* ps);
//头插法插入数据
void SLPushFront(SeqList* ps, SeqListType x);
//尾插法
void SLPushBack(SeqList* ps, SeqListType x);
//头删法
void SLPopFront(SeqList* ps);
//尾删法
void SLPopBack(SeqList* ps);
//指定位置插入数据
void SLInsert(SeqList* ps, int position, SeqListType x);
//指定位置删除
void SLErase(SeqList* ps, int position);
//查找数据
int SLFind(SeqList* ps, SeqListType x);

复制代码

#define _CRT_SECURE_NO_WARNINGS#include"SeqList.h"void SLInit(SeqList* ps){ ps->data = (SeqListType*)malloc(sizeof(SeqListType) * 4); if (ps->data == NULL) { perror("malloc"); return; } ps->size = 0; ps->capacity = 4;}void SLDestory(SeqList* ps){ free(ps->data); ps->data = NULL; ps->size = 0; ps->capacity = 0;}void SLPrint(SeqList* ps){ for (int i = 0; i < ps->size; i++) { printf("%d ", ps->data[i]); } printf("\n");}//检查容量，不足顺便扩容void CheckCapacity(SeqList* ps){ if (ps->capacity == ps->size) { //用realloc给ps->data开辟一个原来2倍的空间 SeqListType* new_ps = (SeqListType*)realloc(ps->data,sizeof(SeqListType)*ps->capacity * 2); if (new_ps != NULL) { ps->data = new_ps; new_ps = NULL; ps->capacity *= 2; } else { perror("realloc"); return; } }}void SLPushFront(SeqList* ps, SeqListType x){ //检查现在容量，不足就扩容 CheckCapacity(ps); for (int i = ps->size - 1; i >= 0; i--) { ps->data[i + 1] = ps->data[i]; } ps->data[0] = x; ps->size++;}//尾插法void SLPushBack(SeqList* ps, SeqListType x){ CheckCapacity(ps); ps->data[ps->size] = x; ps->size++;}void SLPopFront(SeqList* ps){ //这里断言的缘故起因是，如果ps是空指针，for循环条件判断就会访问空指针 assert(ps != NULL);//*****************当size==0时，也会实行ps->size--,后续大概会造成越界访问*************** assert(ps->size > 0); for (int i = 1; i < ps->size; i++) { ps->data[i - 1] = ps->data[i]; } ps->size--;}//尾删法void SLPopBack(SeqList* ps){ assert(ps != NULL); assert(ps->size > 0); ps->size--;}void SLInsert(SeqList* ps, int position, SeqListType x){ assert(ps != NULL); assert(position >= 1 && position <= ps->size); CheckCapacity(ps); for (int i = ps->size - 1; i >= position - 1; i--) { ps->data[i + 1] = ps->data[i]; } ps->data[position - 1] = x; ps->size++;}void SLErase(SeqList* ps, int position)
{
assert(ps != NULL);
assert(position >= 1 && position <= ps->size);
assert(ps->size > 0);
for (int i = position; i < ps->size; i++)
{
ps->data[i - 1] = ps->data[i];
}
ps->size--;
}
int SLFind(SeqList* ps, SeqListType x)
{
assert(ps != NULL);
for (int i = 0; i < ps->size; i++)
{
if (ps->data[i] == x)
return i;
}
return -1;
}

复制代码