线性表的顺序存储

//头文件.h

#include"stdlib.h"
#include"stdio.h"
#include"string.h"
#ifndef _MY_SEQLIST_H_ 
#define _MY_SEQLIST_H_
typedef void SeqList;
typedef void SeqListNode;

//创建并且返回一个空的线性表
SeqList* Seqlist_Create(int capacity);

//销毁一个线性表
void  SeqList_Destroy(SeqList* list);

//将一个线性表list中的所有元素清空, 线性表回到创建时的初始状态 
void SeqList_Clear(SeqList* list);

//返回一个线性表list中的所有元素个数 
int  SeqList_Length(SeqList* list);

//返回一个线性表list中的容量
int SeqList_capacity(SeqList* list);

//向一个线性表list的pos位置处插入新元素node 
int SeqList_Insert(SeqList* list, SeqListNode* node, int pos);

//获取一个线性表list的pos位置处的元素
SeqListNode* Seqlist_Get(SeqList* list, int pos);

//删除一个线性表list的pos位置处的元素返回值为被删除的元素，NULL表示删除失败 
SeqListNode* Seqlist_Delete(SeqList* list, int pos);

#endif

//函数实现.c

#include"stdlib.h"
#include"stdio.h"
#include"string.h"
#include"Seqlist.h"
typedef struct _tag_Seqlist
{
	int length;//长度
	int capacity;//容量
	unsigned int* node;//数组
}TSeqlist;


//创建并且返回一个空的线性表
SeqList* Seqlist_Create(int capacity)
{   //创建线性表
	int ret = 0;
	TSeqlist *tmp=NULL;
	tmp = (TSeqlist *)malloc(sizeof(TSeqlist));
	if (tmp==NULL)
	{
		ret = -1;
		printf("func:Seqlist_Create err%d\n",ret);
		return NULL;
	}
	memset(tmp, 0, sizeof(TSeqlist));
	//根据capacity大小分配结点的空间
	tmp->node = (unsigned int *)malloc(sizeof(unsigned int *) * capacity);
	if (tmp->node == NULL)
	{
		ret = -2;
		printf("func:Seqlist_Create err:malloc err %d\n", ret);
		return NULL;
	}
	tmp->capacity = capacity;
	tmp->length = 0;
	return tmp;
}
//销毁一个线性表
void  SeqList_Destroy(SeqList* list)
{
	TSeqlist *tlist=NULL;
	if (list == NULL)
	{
		return ;
	}
	tlist = (TSeqlist *)list;//强制转换
	if (tlist->node!=NULL)
	{
		free(tlist->node);
	}
	free(tlist);
	return ;
}
//将一个线性表list中的所有元素清空, 线性表回到创建时的初始状态 
void SeqList_Clear(SeqList* list)
{
	TSeqlist *tlist = NULL;
	if (list == NULL)
	{
		return ;
	}
	tlist = (TSeqlist *)list;
	tlist->length = 0;
	return;
}
//返回一个线性表list中的所有元素个数 
int  SeqList_Length(SeqList* list)
{
	TSeqlist *tlist = NULL;
	if (list == NULL)
	{
		return -1;
	}
	tlist = (TSeqlist *)list;
	return  tlist->length;
}

//返回一个线性表list中的容量
int SeqList_capacity(SeqList* list)
{
	TSeqlist *tlist = NULL;
	if (list == NULL)
	{
		return -1;
	}
	tlist = (TSeqlist *)list;
	return  tlist->capacity;
	return 0;
}
//向一个线性表list的pos位置处插入新元素node 
int SeqList_Insert(SeqList* list, SeqListNode* node, int pos)
{
	int i = 0, ret = 0;
	TSeqlist *tlist = NULL;
	
	if (list == NULL || node==NULL || pos<0)
	{
		ret = -1;
		printf("SeqList_Insert err%d\n",ret);
		return ret;
	}
	tlist = (TSeqlist *)list;

	//判断是不是满了
	if (tlist->length>=tlist->capacity)
	{
		ret = -2;
		printf("Func:SeqList_Insert err :tlist->length>=tlist->capacity err %d\n", ret);
		return ret;
	}

	//容错修正
	if (pos >= tlist->length)
	{
		pos = tlist->length;
	}

	//元素后移
	for ( i = tlist->length; i > pos; i--)
	{
		tlist->node[i] = tlist->node[i - 1];
	}

	//元素插入
	tlist->node[pos] = (unsigned int)node;
	tlist->length++;
	return 0;
}
//获取一个线性表list的pos位置处的元素
SeqListNode* Seqlist_Get(SeqList* list, int pos)
{
	int i = 0;
	SeqListNode *ret = 0;
	TSeqlist *tlist = NULL;

	if (list == NULL || pos<0)
	{
		printf("Func:Seqlist_Get err%d\n", ret);
		return ret;
	}
	tlist = (TSeqlist *)list;
	ret = tlist->node[pos];
	return ret ;
}
//删除一个线性表list的pos位置处的元素返回值为被删除的元素，NULL表示删除失败 
SeqListNode* Seqlist_Delete(SeqList* list, int pos)
{
	int i = 0;
	SeqListNode *ret = 0;
	TSeqlist *tlist = NULL;

	//检查
	if (list == NULL || pos<0)
	{
		printf("SeqList_Insert err%d\n", ret);
		return ret;
	}
	tlist = (TSeqlist *)list;

	//缓存pos位置
	ret = (SeqListNode *)tlist->node[pos];

	//元素前移
	for (i = pos + 1; i < tlist->length; i++)
	{
		tlist->node[i-1] = tlist->node[i];
	}
	tlist->length--;
	return ret;
}

//测试

#include"stdlib.h"
#include"stdio.h"
#include"string.h"
#include"Seqlist.h"

typedef struct Teacher
{
	int age;
	char name[64];
}Teacher;
int main()
{
	int i=0;
	int ret = 0;
	SeqList* list = NULL;
	Teacher t1, t2, t3, t4, t5;
	t1.age = 30;
	t1.age = 31;
	t1.age = 32;
	t1.age = 33;
	t1.age = 34;
	list = Seqlist_Create(10);
	if (list == NULL)
	{
		printf("Seqlist_Create err%d\n",ret);
		return ;
	}
	
      SeqList_Insert(list, (SeqListNode*)&t1, 0);
	  SeqList_Insert(list, (SeqListNode*)&t2, 0);
	  SeqList_Insert(list, (SeqListNode*)&t3, 0);
	  SeqList_Insert(list, (SeqListNode*)&t4, 0);
	  SeqList_Insert(list, (SeqListNode*)&t5, 0);
	//遍历
	for (i = 0; i < SeqList_Length(list);i++)
	{
		Teacher *tmp = (Teacher *) Seqlist_Get(list, i);
		if (tmp == NULL)
		{
			return;
		}
		printf("tmp->age:%d\t", tmp->age);
	}

	//删除链表节点
	while (SeqList_Length(list)>0)
	{
		Seqlist_Delete(list, 0);
	}
	system("pause");
	return 0;
}