顺序表

-------------------------------------------------
              
#pragma once

typedef int SLDataType; // 可以方便  进行更改  顺序表中 数据存放的类型
#include <stdio.h>
#include<stdlib.h>
#include<assert.h>

//用结构体定义一个顺序表 ----> 一个结构体变量 就可 表示一个顺序表
typedef struct SeqList
{
	SLDataType* Array;
	int size;         // 该顺序表的有效长度
	int capacity;     // 顺序表的容量
}SeqList;
----------------------------------------------------
//声明该顺序表具有的 增删查改 的方法

//<1>尾插
void SeqListPushBack(SeqList* ps, SLDataType x); // ps 指向 需被修改的顺序表

//<2>尾删
void SeqListPopBack(SeqList* ps);

//<3>头插
void SeqListPushFront(SeqList* ps, SLDataType x);

//<4>头删
void SeqListPopFront(SeqList* ps);

//<5>随机插入
void SeqListInsert(SeqList* ps, int pos, SLDataType x);

//<6>随机删除
void SeqListErase(SeqList* ps, int pos);

//<7>查找
int SeqListFind(SeqList* ps, SLDataType x);

//<8>初始化顺序表
void SeqListInit(SeqList* ps);

//<9>检查顺序表是否扩容
void CheckSeqList(SeqList* ps);

//<10>打印顺序表
void PrintSeqList(SeqList* ps);
-------------------------------------------------
#include"SeqList.h"

void SeqListInit(SeqList* ps) // 默认初始容量为四
{
	ps->Array = (SLDataType*)malloc(sizeof(SLDataType)*4);

	if (ps->Array == NULL) //申请内存失败
	{
		printf("申请内存失败\n");
		exit(-1);
	}

	ps->size = 0;
	ps->capacity = 4;
}

void CheckSeqList(SeqList* ps)
{
	assert(ps);
	if (ps->capacity == ps->size)
	{
		ps->capacity *= 2;
		ps->Array = (SLDataType*)realloc(ps->Array ,sizeof(SLDataType)*ps->capacity );
		if (ps->Array == NULL)
		{
			printf("扩容失败\n");
			exit(-1);
		}
	}
}

void PrintSeqList(SeqList* ps)
{
	assert(ps);
	int i;
	for ( i = 0; i < ps->size; ++i)
	{
		printf("%d ",ps->Array[i]);
	}
	printf("\n");
}

void SeqListPushBack(SeqList* ps, SLDataType x)
{
	assert(ps);
	CheckSeqList(ps);
	ps->Array[ps->size] = x;
	ps->size++;
}

void SeqListPopBack(SeqList* ps)
{
	assert(ps);
	ps->size--;
}

void SeqListPushFront(SeqList* ps, SLDataType x)
{
	assert(ps);
	CheckSeqList(ps);
	int movePos = ps->size - 1;
	while (movePos >= 0)//移位
	{
		ps->Array[movePos + 1] = ps->Array[movePos];
		movePos--;
	}
	ps->Array[0] = x;  //插入
	ps->size++;
}

void SeqListPopFront(SeqList* ps)
{
	assert(ps);
	int start = 0;
	while (start < ps->size - 1)
	{
		ps->Array[start] = ps->Array[start + 1];
		start++;
	}
	ps->size--;
}

void SeqListInsert(SeqList* ps, int pos, SLDataType x)
{
	assert(ps);
	assert(pos >= 0 && pos <= ps->size);
	CheckSeqList(ps);
	int end = ps->size - 1; 
	for (end; end >= pos; --end)  //包含头插和尾插
	{
		ps->Array[end + 1] = ps->Array[end];
	}
	ps->Array[pos] = x;
	ps->size++;
}

void SeqListErase(SeqList* ps, int pos)
{
	assert(ps);
	assert(pos >= 0 && pos < ps->size);
	int start = pos;
	while (start <= ps->size - 1)
	{
		ps->Array[start] = ps->Array[start + 1];
		start++;
	}
	ps->size--;
}

int SeqListFind(SeqList* ps ,SLDataType x)
{
	assert(ps);
	for (int i = 0; i < ps->size; i++)
	{
		if (ps->Array[i] == x)
		{
			return i;
		}
	}
	return -1;
}