顺序表

最新推荐文章于 2024-09-04 14:03:13 发布

在下yo

最新推荐文章于 2024-09-04 14:03:13 发布

阅读量91

点赞数

分类专栏：数据结构文章标签：数据结构 c语言

本文链接：https://blog.csdn.net/qq_45035125/article/details/105794195

版权

数据结构专栏收录该内容

7 篇文章 0 订阅

订阅专栏

顺序表
在这里插入图片描述
C语言实现顺序表，完成顺序表的初始化、增、删、查、扩容等操作…

test.c

#include "seqlist.h"

int main()
{
	SeqList mylist;
	SeqListInIt(&mylist);

	//printf("SeqList capacity = %d\n", SeqListCapacity(&mylist));
	//_Inc(&mylist);
	//printf("SeqList capacity = %d\n", SeqListCapacity(&mylist));

	ElemType item, key;
	int select = 1;
	int pos = 0;
	while (select)
	{
		printf("*********************************************\n");
		printf("*  [1]push_back             [2]push_front   *\n");
		printf("*  [3]show_list             [4]pop_back     *\n");
		printf("*  [5]pop_front             [6]insert_pos   *\n");
		printf("*  [7]insert_value          [8]delete_pos   *\n");
		printf("*  [9]delete_value          [10]find_value  *\n");
		printf("*  [11]length               [12]capacity    *\n");
		printf("*  [13]sort                 [14]reverse     *\n");
		printf("*  [15]clear                [16]remove_all  *\n");
		printf("*  [0]quit_system                           *\n");
		printf("*********************************************\n");
		printf("请选择:>");
		scanf("%d", &select);
		if (select == 0)
			break;
		switch (select)
		{
		case 1:
			printf("请输入要插入的值（1以 -1 结束）:>");
			while (scanf("%d", &item), item != -1)
			{
				SeqListPushBack(&mylist, item);
			}
			printf("尾部插入数据成功...\n");
			break;
		case 2:
			printf("请输入要插入的值（1以 -1 结束）:>");
			while (scanf("%d", &item), item != -1)
			{
				SeqListPushFront(&mylist, item);
			}
			printf("头部插入数据成功...\n");
			break;
		case 3:
			SeqListShow(&mylist);
			break;
		case 4:
			SeqListPopBack(&mylist);
			printf("删除成功...\n");
			break;
		case 5:
			SeqListPopFront(&mylist);
			printf("删除成功...\n");
			break;
		case 6:
			printf("请输入要插入的位置:>");
			scanf("%d", &pos);
			printf("请输入要插入的数据:>");
			scanf("%d", &item);
			SeqListInsertByPos(&mylist, pos, item);
			printf("插入数据成功...\n");
			break;
		case 7:
			SeqListSort(&mylist);
			printf("请输入要插入的数据:>");
			scanf("%d", &item);
			SeqListInsertByVal(&mylist, item);
			printf("插入数据成功...\n");
			break;
		case 8:
			printf("请输入要删除的位置:>");
			scanf("%d", &pos);
			SeqListIDeleteByPos(&mylist, pos);
			printf("删除成功...\n");
			break;
		case 9:
			printf("请输入要删除的数据:>");
			scanf("%d", &key);
			SeqListIDeleteByVal(&mylist, key);
			printf("删除成功...\n");
			break;
		case 10:
			printf("请输入要查找的值:>");
			scanf("%d", &key);
			pos = SeqListFind(&mylist, key);
			if (pos == -1)
			{
				printf("要查找的值不存在...\n");
			}
			else
			{
				printf("要查找的值的位置为：%d\n",pos);
			}
			break;
		case 11:
			printf("SeqList length = %d\n", SeqListLength(&mylist));
			break;
		case 12:
			printf("SeqList capacity = %d\n", SeqListCapacity(&mylist));
			break;
		case 13:
			SeqListSort(&mylist);
			printf("顺序表排序成功...\n");
			break;
		case 14:
			SeqListReverse(&mylist);
			printf("顺序表逆序成功...\n");
			break;
		case 15:
			SeqListClear(&mylist);
			printf("清除数据表成功...\n");
			break;
		case 16:
			printf("请输入要删除的数据:>");
			scanf("%d", &key);
			SeqListRemoveAll(&mylist, key);
			printf("删除成功...\n");
			break;
		}
	}
	SeqListDestroy(&mylist);
	printf("Cood by...\n");
	system("pause");
	return 0;
}

common.h

#ifndef _COMMON_H_
#define _COMMOM_H_

#include <stdio.h>
#include <assert.h>
#include <stdbool.h>

#define ElemType int

void Swap(ElemType *a, ElemType *b)
{
	ElemType temp = *a;
	*a = *b;
	*b = temp;
}

#endif /*_COMMOM_H_*/

seqlist.h

#ifndef _SEQLIST_H_
#define _SEQLIST_H_

#include "common.h"
#define SEQLIST_DEFAULT_SIZE 8

//定义顺序表结构
typedef struct SeqList
{
	ElemType *base;
	size_t capacity;
	size_t size;
}SeqList;

///
//声明函数接口
static bool _Inc(SeqList *pst);

void SeqListInIt(SeqList *pst);
bool IsFull(SeqList *pst);
bool IsEmpty(SeqList *pst);
void SeqListPushBack(SeqList *pst, ElemType x);
void SeqListPushFront(SeqList *pst, ElemType x);
void SeqListPopBack(SeqList *pst);
void SeqListPopFront(SeqList *pst);

void SeqListInsertByPos(SeqList *pst, int pos, ElemType x);
void SeqListInsertByVal(SeqList *pst, ElemType x);
void SeqListIDeleteByPos(SeqList *pst, int pos);
void SeqListIDeleteByVal(SeqList *pst, ElemType key);
void SeqListRemoveAll(SeqList *pst, ElemType key);
void SeqListSort(SeqList *pst);
int SeqListFind(SeqList *pst, ElemType key);
void SeqListReverse(SeqList *pst);

size_t SeqListLength(SeqList *pst);
size_t SeqListCapacity(SeqList *pst);
void SeqListClear(SeqList *pst);
void SeqListShow(SeqList *pst);
void SeqListDestroy(SeqList *pst);

///
//函数接口实现

//扩容
static bool _Inc(SeqList *pst)
{
	ElemType *new_base = (ElemType*)realloc(pst->base, sizeof(ElemType)*pst->capacity * 2);
	if (new_base == NULL)
		return false;
	pst->base = new_base;
	pst->capacity *= 2;
	return true;
}


//初始化SeqList
void SeqListInIt(SeqList *pst)
{
	pst->base = (ElemType*)malloc(sizeof(ElemType)*SEQLIST_DEFAULT_SIZE);
	assert(pst->base != NULL);
	memset(pst->base, 0, sizeof(ElemType)*SEQLIST_DEFAULT_SIZE);
	pst->capacity = SEQLIST_DEFAULT_SIZE;
	pst->size = 0;
}


bool IsFull(SeqList *pst)
{
	assert(pst != NULL);
	return pst->size >= pst->capacity;
}

bool IsEmpty(SeqList *pst)
{
	assert(pst != NULL);
	return pst->size == 0;
}

//头部插入元素
void SeqListPushFront(SeqList *pst, ElemType x)
{
	assert(pst != NULL);

	if (IsFull(pst) && !_Inc(pst)) //短路求值
	{
		//空间满了并扩容不成功
		printf("顺序表空间已满,不能插入数据 %d\n", x);
		return;
	}
	for (size_t pos = pst->size; pos > 0; --pos)
	{
		pst->base[pos] = pst->base[pos-1];
	}
	pst->base[0] = x;
	pst->size++;
}

//尾部插入元素
void SeqListPushBack(SeqList *pst, ElemType x)
{
	assert(pst != NULL);
	if (IsFull(pst) && !_Inc(pst))
	{
		printf("顺序表已满，不能插入数据:%d\n", x);
		return;
	}
	pst->base[pst->size++] = x;
}

//尾部删除元素
void SeqListPopBack(SeqList *pst)
{
	assert(pst != NULL);
	pst->size--;
}

//头部删除元素
void SeqListPopFront(SeqList *pst)
{

	assert(pst != NULL);
	if (IsEmpty(pst))
	{
		printf("顺序表为空，不能从尾部删除元素...\n");
		return;
	}
	for (int i = 0; i < pst->size; i++)
	{
		pst->base[i] = pst->base[i + 1];
	}
	pst->size--;
}

//按位置插入
void SeqListInsertByPos(SeqList *pst, int pos, ElemType x)
{
	assert(pst != NULL);
	if (pos < 0 || pos >pst->size)
	{
		printf("插入的位置非法，数据 %d 不能被插入...\n", x);
		return;
	}
	if (IsFull(pst) && !_Inc(pst))
	{
		printf("顺序表已满，不能按位置插入数据:%d\n", x);
		return;
	}
	for (int i = pst->size; i > pos; --i)
	{
		pst->base[i] = pst->base[i - 1];
	}
	pst->base[pos] = x;
	pst->size++;
}

//按值插入
void SeqListInsertByVal(SeqList *pst, ElemType x)
{
	assert(pst != NULL);
	if (IsFull(pst) && !_Inc(pst))
	{
		printf("顺序表已满，不能按值插入数据:%d\n", x);
		return;
	}
	int end = pst->size;
	while (end > 0 && x < pst->base[end - 1])
	{
		pst->base[end] = pst->base[end - 1];
		end--;
	}
	pst->base[end] = x;
	pst->size++;
}

//按位置删除
void SeqListIDeleteByPos(SeqList *pst, int pos)
{
	assert(pst != NULL);
	if (IsEmpty(pst))
	{
		printf("顺序表已空，不能按位值删除数据...\n");
		return;
	}
	if (pos < 0 || pos >= pst->size)
	{
		printf("要删除的位置非法，不能按位值删除数据...\n");
		return;
	}
	for (int i = pos; i < pst->size; i++)
	{
		pst->base[i] = pst->base[i + 1];
	}
	pst->size--;
}

//按值删除
void SeqListIDeleteByVal(SeqList *pst, ElemType key)
{
	assert(pst != NULL);
	if (IsEmpty(pst))
	{
		printf("顺序表已空，不能按值删除数据...\n");
		return;
	}
	int pos = SeqListFind(pst, key);
	if (pos == -1)
	{
		printf("要删除的值不存在...\n");
		return;
	}
	else
	{
		SeqListIDeleteByPos(pst, pos);
	}
}

//删除所有匹配的元素
void SeqListRemoveAll(SeqList *pst, ElemType key)
{
	assert(pst != NULL);
	if (IsEmpty(pst))
	{
		printf("顺序表已空，不能按值删除数据...\n");
		return;
	}
	int pos = SeqListFind(pst, key);
	if (pos == -1)
	{
		printf("要删除的值不存在...\n");
		return;
	}
	while (SeqListFind(pst, key) != -1)
	{
		SeqListIDeleteByPos(pst, pos);
	}
}

//排序
void SeqListSort(SeqList *pst)
{
	assert(pst != NULL);
	if (pst->size <= 1)
		return;
	for (int i = 0; i < pst->size - 1; i++)
	{
		for (int j = 0; j < pst->size - i - 1; j++)
		{
			if (pst->base[j] > pst->base[j + 1])
			{
				ElemType temp = pst->base[j];
				pst->base[j] = pst->base[j+1];
				pst->base[j+1] = temp;
			}
		}
	}
}

//查找
int SeqListFind(SeqList *pst, ElemType key)
{
	assert(pst != NULL);
	for (int i = 0; i < pst->size; ++i)
	{
		if (pst->base[i] == key)
		{
			return i;
		}
	}
	return -1;
}

//转置顺序表
void SeqListReverse(SeqList *pst)
{
	assert(pst != NULL);
	if (pst->size <= 1)
		return;

	int left = 0; 
	int right = pst->size - 1;
	while (left < right)
	{
		Swap(&pst->base[left], &pst->base[right]);
		left++;
		right--;
	}
}

size_t SeqListLength(SeqList *pst)
{
	assert(pst != NULL);
	return pst->size;
}

size_t SeqListCapacity(SeqList *pst)
{
	assert(pst != NULL);
	return pst->capacity;
}

//清空线性表
void SeqListClear(SeqList *pst)
{
	assert(pst != NULL);
	pst->size = 0;
}

//显示SeqList的内容
void SeqListShow(SeqList *pst)
{
	assert(pst != NULL);
	if (IsEmpty(pst))
	{
		printf("顺序表为空...\n");
		return;
	}
	for (size_t i = 0; i < pst->size; ++i)
	{
		printf("%d ", pst->base[i]);
	}
	printf("\n");
}

//摧毁pst->base
void SeqListDestroy(SeqList *pst)
{
	assert(pst != NULL);
	if (pst->base != NULL)
		free(pst->base);
	pst->base = NULL;
	pst->capacity = 0;
	pst->size = 0;
}

#endif /*_SEQLIST_H_*/

在下yo

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
顺序表

顺序表完成顺序表的初始化、增、删、查、扩容等操作test.c#include "seqlist.h"int main(){ SeqList mylist; SeqListInIt(&mylist); //printf("SeqList capacity = %d\n", SeqListCapacity(&mylist)); //_Inc(&mylist...
复制链接

扫一扫

专栏目录