顺序表的C语言实现

最新推荐文章于 2024-07-25 11:35:59 发布

秋枫晨语

最新推荐文章于 2024-07-25 11:35:59 发布

阅读量521

点赞数 3

文章标签： c语言数据结构

本文链接：https://blog.csdn.net/Time_Chaser/article/details/126815340

版权

头文件：SeqList.h

#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
typedef int SLDataType;
typedef struct SeqList
{
    SLDataType* a;
    int size;
    int capacity;
}SL;
extern void SeqListInit(SL*);
extern void SeqListDestroy(SL*);
extern void SeqListPrint(SL*);
extern void SeqListPushFront(SL*, SLDataType);
extern void SeqListPushBack(SL*, SLDataType);
extern void SeqListPopFront(SL*);
extern void SeqListPopBack(SL*);
extern int SeqListFind(SL*, SLDataType);
extern void SeqListInsert(SL*, size_t, SLDataType);
extern void SeqListErase(SL*, size_t);
extern void SeqListModify(SL*, size_t, SLDataType);

源文件：SeqList.c

#include"SeqList.h"
void SeqListInit(SL* psl)
{
	assert(psl);
	psl->a = NULL;
	psl->capacity = psl->size = 0;
}
void SeqListDestroy(SL* psl)
{
	assert(psl);
	free(psl->a);
	psl->a = NULL;
	psl->capacity = psl->size = 0;
}
void SeqListPrint(SL* psl)
{
	assert(psl);
	for (int i = 0; i < psl->size; i++)
	{
		printf("%d ", psl->a[i]);
	}
	printf("\n");
}
void SLCheckCapacity(SL* psl)
{
	if (psl->size == psl->capacity)
	{
		int newcapacity = psl->capacity == 0 ? 4 : 2 * psl->capacity;
		SLDataType* tmp = (SLDataType*)realloc(psl->a, newcapacity * sizeof(SLDataType));
		if (tmp == NULL)
		{
			perror("realloc fail");
			exit(EXIT_FAILURE);
		}
		psl->a = tmp;
		psl->capacity = newcapacity;
	}
}
void SeqListPushFront(SL* psl, SLDataType x)
{
	assert(psl);
	SLCheckCapacity(psl);
	int end = psl->size - 1;
	while (end >= 0)
	{
		psl->a[end + 1] = psl->a[end];
		end--;
	}
	psl->a[0] = x;
	psl->size++;
}
void SeqListPushBack(SL* psl, SLDataType x)
{
	assert(psl);
	SLCheckCapacity(psl);
	psl->a[psl->size] = x;
	psl->size++;
}
void SeqListPopFront(SL* psl)
{
	assert(psl);
	assert(psl->size > 0);
	int begin = 0;
	while (begin < psl->size - 1)
	{
		psl->a[begin] = psl->a[begin + 1];
		begin++;
	}
	psl->size--;
}
void SeqListPopBack(SL* psl)
{
	assert(psl);
	assert(psl->size > 0);
	psl->size--;
}
int SeqListFind(SL* psl, SLDataType x)
{
	assert(psl);
	for (int i = 0; i < psl->size; i++)
	{
		if (psl->a[i] == x)
			return i;
	}
	return -1;
}
void SeqListInsert(SL* psl, size_t pos, SLDataType x)
{
	assert(psl);
	assert(pos <= psl->size);
	SLCheckCapacity(psl);
	//写成int i =psl->size;i>=pos 会死循环,size_t
	for (int i = psl->size; i > pos; i--)
	{
		psl->a[psl->size] = psl->a[psl->size - 1];
	}
	psl->a[pos] = x;
	psl->size++;
}
void SeqListErase(SL* psl, size_t pos)
{
	assert(psl);
	assert(pos < psl->size);
	for (int i = pos; i < psl->size - 1; i++)
	{
		psl->a[i] = psl->a[i + 1];
	}
	psl->size--;
}
void SeqListModify(SL* psl, size_t pos, SLDataType x)
{
	assert(psl);
	assert(pos < psl->size);
	psl->a[pos] = x;
}