数据结构之顺序表

.h文件

//#pragma once
#ifndef SQLIST_H_
#define SQLIST_H_

#pragma region Header

#include <iostream>
#include <cstring>
#include <stdio.h>

#pragma endregion

#pragma region Some rudimentary definition

using ElemType = int;	//typedef int ElemType
constexpr int LIST_INIT_SIZE = 100;	//初始分配大小
constexpr int LISTINCREMENT = 10;	//分配增量
constexpr int OK = 0;
constexpr int ERROR = -1;
constexpr int TRUE = 1;
constexpr int FALSE = 0;

#pragma endregion

#pragma region The struct of SqList
struct SqList {
	ElemType* elem = nullptr;
	int listlength = 0;
	int listsize = 0;
};
#pragma endregion

#pragma region Function of SqList
inline void ExistList(SqList L) {
	if (L.elem == nullptr) {
		printf("线性表不存在!\n");
		exit(0);
	}
};
int InitList_Sq(SqList& L);
int DestoryList_Sq(SqList& L);
int ClearList_Sq(SqList& L);
int ListEmpty_Sq(SqList L);
int ListLength_Sq(SqList L);
int GetElem_Sq(ElemType& e, SqList L, int i);
int LocateElem_Sq(SqList L, ElemType e, int (*compare)(ElemType, ElemType));
int PriorElem_Sq(ElemType& pre_e, SqList L, ElemType cur_e);
int NextElem_Sq(ElemType& next_e, SqList L, ElemType cur_e);
int ListInsert_Sq(SqList& L, int i, ElemType e);
int ListDelete_Sq(SqList& L, int i, ElemType& e);
int ListPrint_Sq(SqList L);
#pragma endregion

#endif // !SQLIST_H_

.cpp文件

#include "SqList.h"

#pragma region Function of SqList
/*初始化线性表*/
int InitList_Sq(SqList& L) {
	L.elem = (ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));
	if (L.elem == nullptr) exit(0);
	L.listlength = 0;
	L.listsize = LIST_INIT_SIZE;
	printf("线性表已创建!\n");
	return OK;
}

/*摧毁线性表*/
int DestoryList_Sq(SqList& L) {
	ExistList(L);
	delete L.elem;
	L.elem = nullptr;
	L.listlength = 0;
	L.listsize = 0;
	printf("线性表已销毁!\n");
	return OK;
}

/*清空线性表*/
int ClearList_Sq(SqList& L) {
	ExistList(L);
	L.listlength = 0;
	printf("线性表已清空!\n");
	return OK;
}

/*判断线性表是否为空*/
int ListEmpty_Sq(SqList L) {
	ExistList(L);
	if (L.listlength == 0) {
		return TRUE;
	}
	else {
		return FALSE;
	}
}

/*线性表长度*/
int ListLength_Sq(SqList L) {
	ExistList(L);
	return L.listlength;
}

/*线性表第i个位置的值*/
int GetElem_Sq(ElemType& e, SqList L, int i) {
	ExistList(L);
	if (i > L.listlength || i < 1) {
		printf("位置非法!\n");
		return ERROR;
	}
	e = L.elem[i - 1];
	return OK;
}

/*线性表中第一个与e满足compare()关系的位置*/
int LocateElem_Sq(SqList L, ElemType e, int (*compare)(ElemType, ElemType)) {
	ExistList(L);
	for (int i = 0; i < L.listlength; i++) {
		if (compare(L.elem[i], e)) {
			return i + 1;
		}
	}
	return FALSE;
}

#pragma region Temp Function
int compare_equal(ElemType a, ElemType b) {
	if (a == b) return TRUE;
	else return FALSE;
}
#pragma endregion

/*前驱*/
int PriorElem_Sq(ElemType& pre_e, SqList L, ElemType cur_e) {
	ExistList(L);
	int temp = LocateElem_Sq(L, cur_e, compare_equal);
	switch (temp) {
	case 0:
		printf("元素不存在!\n");
		break;
	case 1:
		printf("前驱不存在!\n");
		break;
	default:
		pre_e = L.elem[temp - 2];
		break;
	}
	return OK;
}

/*后驱*/
int NextElem_Sq(ElemType& next_e, SqList L, ElemType cur_e) {
	ExistList(L);
	int temp = LocateElem_Sq(L, cur_e, compare_equal);
	if (temp == 0) {
		printf("元素不存在!\n");
		return ERROR;
	}
	else if (temp == L.listlength) {
		printf("后驱不存在!\n");
		return ERROR;
	}
	else {
		next_e = L.elem[temp];
		return OK;
	}
}

/*在第i位置之前插入e*/
int ListInsert_Sq(SqList& L, int i, ElemType e) {
	ExistList(L);
	if (i > L.listlength+1 || i < 1) {
		printf("位置非法!\n");
		return ERROR;
	}
	if (L.listlength >= L.listsize) {
		ElemType* newbase = (ElemType*)realloc(L.elem, L.listlength + LISTINCREMENT * sizeof(ElemType));
		if (L.elem == nullptr) exit(0);
		L.elem = newbase;
		L.listsize += LISTINCREMENT;
	}
	ElemType* q = &L.elem[i - 1];
	for (ElemType* p = &L.elem[L.listlength - 1]; p >= q; --p) {
		*(p + 1) = *p;
	}
	*q = e;
	L.listlength++;
	return OK;
}

/*删除第i个元素*/
int ListDelete_Sq(SqList& L, int i, ElemType& e) {
	ExistList(L);
	if (i > L.listlength || i < 1) {
		printf("位置非法!\n");
		return ERROR;
	}
	ElemType* p = &L.elem[i - 1];
	e = *p;
	ElemType* q = &L.elem[L.listlength - 1];
	for (++p; p<= q; p++) {
		*(p - 1) = *p;
	}
	L.listlength--;
	return OK;
}

/*遍历表*/
int ListPrint_Sq(SqList L) {
	ExistList(L);
	for (int i = 0; i < L.listlength; i++) {
		std::cout << L.elem[i] << std::endl;
	}
	return OK;
}

#pragma endregion

main函数

#include "SqList.h"

#pragma region Temp Function
/*寻找第一个大于b的位置*/
int compare(ElemType a, ElemType b) {
	if (a > b) return TRUE;
	else return FALSE;
}
#pragma endregion

int main() {
	SqList sq;
	ElemType e,pre_e,next_e;
	InitList_Sq(sq);//初始化线性表
	if (!ListEmpty_Sq(sq))	printf("线性表非空!\n");//判断线性表是否为空
	else printf("线性表为空!\n");

	for(int i=1;i<10;i++)	//向表里插入9个数据
		ListInsert_Sq(sq, i, i);

	if (!ListEmpty_Sq(sq))	printf("线性表非空!\n");
	else printf("线性表为空!\n");

	printf("线性表长度：%d\n",ListLength_Sq(sq));//输出表长度
	ListPrint_Sq(sq);//输出线性表
	ListDelete_Sq(sq, 3, e);//删除第三个元素
	std::cout << "删除的第三个元素是：" << e << std::endl;//输出删除的元素
	printf("线性表长度：%d\n", ListLength_Sq(sq));
	GetElem_Sq(e, sq, 3);//得到第三个元素
	std::cout << "第三个元素是： " << e << std::endl;//输出第三个元素
	ListPrint_Sq(sq);
	printf("第一个大于5的位置：%d\n",LocateElem_Sq(sq,5,compare));	//输出第一个大于5的位置
	PriorElem_Sq(pre_e, sq, 4);
	printf("4的先驱：%d\n", pre_e);	//输出4的先驱
	NextElem_Sq(next_e, sq, 4);
	printf("4的后驱：%d\n", next_e);	//输出4的后驱
	ClearList_Sq(sq);//清空线性表
	if (!ListEmpty_Sq(sq))	printf("线性表非空!\n");//判断线性表是否为空
	else printf("线性表为空!\n");
	DestoryList_Sq(sq);
	return 0;
}

输出结果

小结

学习笔记，欢迎指正。