数据结构《一》顺序表的实现

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

1. stuct SeqList

typedef int SLDataType;
typedef struct SeqList
{
	SLDataType* array; // 指向动态开辟的数组
	size_t size; // 有效数据个数
	size_t capicity; // 容量空间的大小
}SeqList;

2. 顺序表的初始化

void SeqListInit(SeqList* psl, size_t capacity)
{
	assert(psl != NULL);
	if (capacity == 0)
	{
		printf("input capacity error!");
		return 0;
	}
	psl->array = (SeqList*)malloc(sizeof(SeqList)*capacity);
	assert(psl->array != NULL);
	psl->capicity = capacity;
	psl->size = 0;
}

3. 顺序表的销毁

void SeqListDestory(SeqList* psl)
{
	assert(psl != NULL);
	free(psl->array);
	if (psl->array != NULL)
	{
		psl = NULL;
		psl->capicity = psl->size = 0;
	}
}

4. 顺序表的打印

// 顺序表打印
void SeqListPrint(SeqList* psl)
{
	assert(psl != NULL);
	if (psl->array != NULL)
	{
		for (int i; i < psl->size; i++)
			printf("%-7d", &psl->array[i]);
	}
}

5. 顺序表检查是否存满

void CheckCapacity(SeqList* psl) 
{
	assert(psl != NULL);
	if (psl->size >= psl->capicity)
	{
		psl->array = realloc(psl->array, psl->capicity * 2);
		psl->capicity *= 2;
	}
}

6. 顺序表的头插

void SeqListPushFront(SeqList* psl, SLDataType x)
{
	assert(psl != NULL);
	for (int i = psl->size; i > 0; i--)
	{
		psl->array[i] = psl->array[i - 1];
	}
	psl->array[0] = x;
}

7. 顺序表的头删

void SeqListPopFront(SeqList* psl)
{
	assert(psl != NULL);
	if (psl->size == 0)
	{
		printf("ARRAY IS EMPTY");
		return;
	}
	else
	{
		for (int i = 0; i < psl->size - 1; i++)
		{
			psl->array[i] = psl->array[i + 1];
		}
		psl->size--;
	}
}

8. 顺序表的尾插

void SeqListPushBack(SeqList* psl, SLDataType x) 
{
	assert(psl != NULL);
	CheckCapacity(psl);
	psl->array[psl->size] = x;
	psl->size++;
}

9. 顺序表的尾删

void SeqListPopBack(SeqList* psl)
{
	assert(psl != NULL);
	psl->size--;
	psl->array[psl->size]=0;
}

10. 顺序表的查找

int SeqListFind(SeqList* psl, SLDataType x) 
{
	assert(psl != NULL);
	if (psl->size == 0)
	{
		printf("ARRAY IS EMPTY");
		return 0;
	}
	else
	{
		for (int i = 0; i < psl->size; i++)
		{
			if (psl->array == x)
				return 1;
		}
		return 0;
	}
}

11. 顺序表的按位置插入

void SeqListInsert(SeqList* psl, size_t pos, SLDataType x)
{
	assert(psl == NULL);
	if (pos < 0)
	{
		printf("POS ERROR!");
		return 0;
	}
	else if (pos >= psl->size)
	{
		psl->array[psl->size] = x;
		psl->size++;
	}
	else
	{
		for (int i = psl->size; i > pos; i++)
		{
			psl->array[i] = psl->array[i - 1];
		}
		psl->array[pos] = x;
	}
}

12. 顺序表的按位置删除

void SeqListErase(SeqList* psl, size_t pos)
{
	assert(psl != NULL);
	if (pos<0 || pos>psl->size - 1)
	{
		printf("POS ERROR!");
	}
	else
	{
		for (int i = pos; i < psl->size - 1; i++)
		{
			psl->array[i] = psl->array[i + 1];
		}
	}
}

以上就是顺序表的具体实现，如有小伙伴觉得有问题，可以评论下方戳我哈！