数据结构（C语言）：线性表常用功能

最新推荐文章于 2024-07-11 15:49:26 发布

仙气缭绕街头

最新推荐文章于 2024-07-11 15:49:26 发布

阅读量47

点赞数

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

本文链接：https://blog.csdn.net/2201_75537123/article/details/133363425

版权

完整版

#include<stdio.h>
#include<stdlib.h>
#define MAX_SIZE 100

typedef struct SqList {
	int data[MAX_SIZE];
	int length;
}SqList;

//1.构造空的线性表
void InitList (SqList** L)
{
	(*L) = (SqList*)malloc(sizeof(SqList));
	(*L) -> length = 0;
}

//2.销毁线性表
void DestroyList (SqList** L)
{
	free(*L);
	*L = NULL;
}


//3.判断线性表是否为空
int ListSpmty (SqList* L)
{
	return L -> length == 0;
}

//4.返回元素个数
int ListLength (SqList* L)
{
	return L -> length;
}

//5.打印元素数据
void DispList (SqList* L)
{
	for(int i = 0; i < L -> length; i++)
	{
		printf("%d ",L -> data[i]);
	}	
	printf("\n");
}

//6.返回第i个元素的数据
int GetElem (SqList* L, int loc, int* e)
{
	if (loc < 0 || loc > L -> length)
	{
		return 0;
	}
	*e = L -> data[loc-1];
	return 1;
}

//7.判断位序
int LocateElem (SqList* L,int val)
{
	for(int i = 0; i < L -> length; i++)
	{
		if (L -> data[i] == val)
		{
			return i+1;
		}
	}
	return 0;
}

//8.插入数据
int ListSert(SqList* L, int loc, int val)
{
	if (loc <= 0 || loc > L -> length + 1 || L ->length == MAX_SIZE)
	return 0;
	for(int i = L -> length ; i >= loc; i++)
	{
		L -> data[i] = L -> data[i-1];
	}
	L -> data[loc-1] = val;
	L -> length++;
	return 1;
}


//9.删除数据
int ListDelete(SqList* L, int loc, int* m)
{
	if (loc <= 0 || loc > L -> length + 1)
	return 0;
	int j=0;
	for(int i = 0 ; i < L -> length; i++)
	{
		if(i != loc)
		{
			L -> data[j++] = L ->data[i];
		}
		else
		{
			*m = L -> data[i];
		}
	}
	L -> length--;
	return 1;
}

int main ()
{
	SqList* list;
	
//1生成空表	1
	InitList(&list);
	
//2插入数据 1
	int num[5] = {1, 2, 3, 4, 5};
	for (int i = 0; i < 5; i++)
	{
		ListSert(list, i+1, num[i]);
	}
	
//3打印	1
	DispList(list);
	
//4删除数据 1
//	int m;
//	if(ListDelete(list, 2, &m))
//	{
//		printf("被删除的数据：%d\n", m);
//		printf("当前线性表为：");
//		DispList(list);
//	}

//5判断是否为空表 1
//	if (ListSpmty(list))
//	{
//		printf("空表\n");
//	}
//	else
//	{
//		printf("非空\n");
//	}

//6打印元素个数 1
//	printf("有%d个元素\n",ListLength(list));

//7返回第i个数数据 1
//	int e;
//	if (GetElem(list, 3, &e))
//	{
//		printf("e:%d\n",e);
//	}

//8判断位序 1
//	int w = LocateElem(list, 3);
//	printf("%d\n",w);
	
//9销毁表 1
//  DestroyList(&list);	
//	if(list==NULL)
//	{
//		printf("1\n");
//	}
	system("pause");
	return 0;
}

功能实现

1.构造空的线性表

void InitList (SqList** L)
{
	(*L) = (SqList*)malloc(sizeof(SqList));
	(*L) -> length = 0;
}

2.销毁线性表

void DestroyList (SqList** L)
{
	free(*L);
	*L = NULL;
}

3.判断线性表是否为空

int ListSpmty (SqList* L)
{
	return L -> length == 0;
}`

4.返回元素个数

int ListLength (SqList* L)
{
	return L -> length;
}

5.打印元素数据

void DispList (SqList* L)
{
	for(int i = 0; i < L -> length; i++)
	{
		printf("%d ",L -> data[i]);
	}	
	printf("\n");
}

6.返回第i个元素的数据

int GetElem (SqList* L, int loc, int* e)
{
	if (loc < 0 || loc > L -> length)
	{
		return 0;
	}
	*e = L -> data[loc-1];
	return 1;
}

7.判断位序

int LocateElem (SqList* L,int val)
{
	for(int i = 0; i < L -> length; i++)
	{
		if (L -> data[i] == val)
		{
			return i+1;
		}
	}
	return 0;
}

8.插入数据

int ListSert(SqList* L, int loc, int val)
{
	if (loc <= 0 || loc > L -> length + 1 || L ->length == MAX_SIZE)
	return 0;
	for(int i = L -> length ; i >= loc; i++)
	{
		L -> data[i] = L -> data[i-1];
	}
	L -> data[loc-1] = val;
	L -> length++;
	return 1;
}

9.删除数据

int ListDelete(SqList* L, int loc, int* m)
{
	if (loc <= 0 || loc > L -> length + 1)
	return 0;
	int j=0;
	for(int i = 0 ; i < L -> length; i++)
	{
		if(i != loc)
		{
			L -> data[j++] = L ->data[i];
		}
		else
		{
			*m = L -> data[i];
		}
	}
	L -> length--;
	return 1;
}