数据结构动态存储的顺序表

Posted 2021-12-19 Suk_god

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了数据结构动态存储的顺序表相关的知识，希望对你有一定的参考价值。

文章目录

顺序表的概念及结构
- 分类
- - 1. 静态顺序表：使用定长数组存储元素。
  - 2.动态顺序表：使用动态开辟的数组存储。
相关接口的实现
- 动态开辟空间
- 相关函数操作申明
相关代码分享
思考与总结

顺序表的概念及结构

顺序表是用一段物理地址连续的存储单元依次存储数据元素的线性结构，一般情况下采用数组存储。在数组上完成数据的增删查改。

相关代码分享

#include"SeqList.h"

void SeqListInit(SeqList *ps, int initCapacity)

	assert(ps);
	ps->array = (SLDateType*)malloc(sizeof(SLDateType)*initCapacity);
	if (NULL == ps->array)
	
		return;
	
	ps->capacity = initCapacity;
	ps->size = 0;



void SeqListDestory(SeqList *ps)

	assert(ps);
	free(ps->array);
	ps->array = NULL;
	ps->capacity = 0;
	ps->size = 0;



static void CheckCacpity(SeqList* ps)

	if (ps->size == ps->capacity)
	
		size_t newCapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;//成倍扩大
		ps->array = (SLDateType*)realloc(ps->array,sizeof(SLDateType)*newCapacity);
		if (ps->array == NULL)
		
			perror("realloc");
			return;
		
		ps->capacity = newCapacity;
	


void SeqListPrint(SeqList* ps)

	assert(ps);
	for (size_t i = 0; i < ps->size; i++)
	
		printf("%d  ",ps->array[i]);
	
	printf("\\n");




//尾插
void SeqListPushBack(SeqList* ps, SLDateType x)
 
	assert(ps);
	CheckCacpity(ps);
	ps->array[ps->size] = x;
	ps->size++;

//尾删
void SeqListPopBack(SeqList* ps)

	assert(ps);
	ps->array[ps->size - 1] = 0;
	ps->size--;


//头插
void SeqListPushFront(SeqList* ps, SLDateType x)

	assert(ps);
	CheckCacpity(ps);
	for (int i = ps->size - 1; i >= 0; i--)
	
		ps->array[i + 1] = ps->array[i];
	
	ps->array[0] = x;
	ps->size++;

//头删
void SeqListPopFront(SeqList* ps)

	assert(ps);
	for (size_t i = 1; i < ps->size; i++)
	
		ps->array[i - 1] = ps->array[i];
	
	ps->size--;


int SeqListFind(SeqList* ps, SLDateType x)

	for (size_t i = 0; i < ps->size; i++)
	
		if (ps->array[i] == x)
			return i;
	
	return -1;



void SeqListInsert(SeqList* ps, size_t pos, SLDateType x)

	assert(ps);
	if (pos > ps->size)
		return;
	CheckCacpity(ps);
	for (size_t i = ps->size - 1; i >= pos; i--)
	
		ps->array[i + 1] = ps->array[i];
	
	ps->array[pos] = x;
	ps->size++;


//删除pos处的数据
void SeqListErase(SeqList* ps, size_t pos)

	assert(ps);
	if (pos<0 || pos>ps->size)
		return;

	for (size_t i = pos; i < ps->size-1; i++)
	
		ps->array[i] = ps->array[i + 1];
	
	ps->size--;




void MyTsetFunction()

	SeqList SL;
	SeqListInit(&SL,5);
	SeqListPushBack(&SL,1);
	SeqListPushBack(&SL, 2);
	SeqListPushBack(&SL, 3);
	SeqListPushBack(&SL, 4);
	SeqListPushBack(&SL, 5);
	SeqListPrint(&SL);

	SeqListPushFront(&SL, 2);
	SeqListPushFront(&SL, 3);

	SeqListPopBack(&SL);
	SeqListPopFront(&SL);

	SeqListInsert(&SL,5,100);
	SeqListErase(&SL, 2);

	SeqListPrint(&SL);

	SeqListDestory(&SL);