【数据结构与算法】

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>

#define SEQ_INIT_SIZE 2
#define SEQ_INC_SIZE 2

typedef int ElemType;
typedef struct
{
	ElemType *data;
	int capacity;//容量 
	int cursize;//元素个数 
}SeaList

初始化

//初始化
void InitSeqList(SeqList *plist)
{
	assert(plist != NULL);
	plist->capacity = SEQ_INIT_SIZE;
	plist->cursize = 0;
	plist->date = ((ElemType*)malloc(sizeof(ElemType)*plist->capacity);
	if(NULL == plist->date)//如果失败 
	{
		printf("内存申请失败\n");
		exit(EXIT_FAILURE);//程序终止 
	}
 } 

获取 元素个数

int GetSize(SeqList *plist)
{
	assert(plist != NULL);
	return plist->cursize;
}

是否为空

bool IsEmpty(Seqlist *plist)
{
	assert(plist != NULL);
	return GetSize(plist) == 0;
 } 

获取容量

 int GetCapacity(SeqList *plist)
 {
 	assert(plist != NULL);
 	return plist->capacity;
 }

判断是否满

bool IsFull(SeqList *plist)
{
	assert(plist != NULL);
	return GetSize(plist) == GetCapacity(plist);
 } 

增容

bool Inc_Capacity(SeqList *plist)
{
	assert(plist != NULL);
	ElemType *newdate = NULL;//创建一个空链表
	int total = plist->capacity * SEQ_INC_SIZE;//capacity:容积
	newdate = (ElemType*)malloc(sizeof(ElemType)*total);//申请内存；
	if(NULL == newdate)
	{
		return false;//分配内存失败 
	} 
	for(int i = 0;i<plist->capaciy;++i)//数据转移 
	{
		newdate[i] = plist->date[i];
	}
	free(plist->date);//释放旧表
	plist->date = newdate;
	plist->capacity = total;
	return true; 
}

插入函数 (含增容)

bool InsertItem(SeqList *plist, int pos, ElemType val)//pos:插入位置  val:插入数据 
{
	assert(plist != NULL);//判断
	if(pos < 0 || pos > plist->cursize)//cursize:表的数据个数
	{
		return false;
	 } 
	if(IsFull(plist) && !Inc_Capacity(plist))//判断是否满->增容
	 {
	 	return false;
	  } 
	for(int i = plist->cursize ; i > pos; --i)//从后遍历到插入位置，遍历数据向后移 
	{
		plist->date[i] = plist->date[i-1];
	}
	plist->date[pos] = val;
	plist->cursize +=1;
	return ture;
}

头插入

void Push_Front(SeaList *plist,ElemType val)
{
	assert(plist != NULL);
	InsertItem(plist,0,val);
 } 

尾插入

void Push_Back(Seaplist *plist,ElemType val)
{
	assert(plist != NULL);
	InsertItem(plist,plist->cursize,val);
 }

查找(有则返回下标)

int FindValue(SeqList *plist,ElemTYpe val)
{
	assert(plist != NULL);
	int pos = -1;
	for(int i = 0;i<plist->cursize;++1)
	{
		if(val = plist->date[i])//如果找到 
		{
			pos = i;//返回下标 
			break;
		}
	}
	return pos;
 }