线性表ADT的实现(C语言数组实现)

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

#define SIZE 100

//数组类型声明
struct List
{
	int elements[SIZE];
	int length;
};

//创建一个空表
struct List* createList()
{
	struct List* p;
	p = (struct List*)malloc(sizeof(struct List));
	p->length = 0;

	return p;
}

//在表的头部插入
void insertFirst(struct List* p, int x)
{
	int i;
	if ((p->length >= SIZE))
	{
		printf("表已满\n");
		return;
	}

	for (i = p->length; i > 0; i--)
	{
		p->elements[i] = p->elements[i - 1];
	}
	p->elements[0] = x;
	p->length++;

	return;
}

//打印表中数据
void printList(struct List* p)
{
	int i;
	for (i = 0; i < p->length; i++)
	{
		printf("list elements is:%d\n", p->elements[i]);
	}
}

//在表的尾部插入
void insertLast(struct List* p, int x)
{
	int length = p->length;
	if (length >= SIZE)
	{
		printf("表已满\n");
		return;
	}
	p->elements[length] = x;
	p->length++;
}

//查找值,如果找到返回数组下标，找不到返回-1
int find(struct List* p, int x)
{
	int i;
	for (i = 0; i < p->length; i++)
	{
		if (p->elements[i] == x)
		{
			return i;
		}
	}

	return -1;
}

//查找某个元素，返回元素的值
int findKth(struct List* p, int position)
{
	if (position <= 0)
	{
		printf("position不能为0或负数");
		exit(1);
	}

	if (position > p->length)
	{
		printf("position超出表的长度\n");
		exit(1);
	}

	return p->elements[position - 1];
}

//删除第一个值匹配的元素
void Delete(struct List* p, int x)
{
	int i;
	for (i = 0; i < p->length; i++)
	{
		if (p->elements[i] == x)
		{
			for (; i < p->length - 1; i++)
			{
				p->elements[i] = p->elements[i + 1];
			}
			p->length--;

			break;
		}
	}
}

//判断表是否为空
bool isEmpty(struct List* p)
{
	return p->length == 0;
}

//获取表的大小
int size(struct List* p)
{
	return p->length;
}


//主函数
int main(void)
{
	//创建表
	struct List* list = createList();

	//判断表是否为空表
	printf("List isEmpty?:%d\n", isEmpty(list));
	printf("=======================\n");

	//从表的头部插入
	insertFirst(list, 1);
	insertFirst(list, 2);
	//打印表中的结点数据
	printList(list);
	printf("=======================\n");

	//从表的尾部插入
	insertLast(list, 3);
	insertLast(list, 4);
	//打印表中的结点数据
	printList(list);
	printf("=======================\n");

	//判断表是否为空表
	printf("List isEmpty?:%d\n", isEmpty(list));
	printf("=======================\n");

	//查找表中结点值
	int index = find(list, 3);
	if (index == -1)
	{
		printf("not find...\n");
	}
	else
	{
		printf("find element index:%d\n", index);
	}
	printf("=======================\n");

	//查找表中的某个元素
	int element = findKth(list, 2);
	printf("find element:%d\n", element);
	printf("=======================\n");

	//删除第一个值匹配的元素
	Delete(list, 3);
	printList(list);
	printf("=======================\n");

	//获取表的大小
	printf("List size is:%d\n", size(list));
	printf("=======================\n");
}