第二章 线性表 顺序表的顺序表示和实现

参考B站上青岛大学-王卓老师视频做的总结

代码：

#define _CRT_SECURE_NO_WARNINGS
#define MAXSIZE 100
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 1
#define INFEASIBLE -1
#define OVERFLOW -2
#include<stdio.h>
#include<stdlib.h>
typedef int Status;
typedef char ElemType;

//定义顺序表类型
typedef struct
{
	ElemType* elem;
	int length;
}SqList;

//初始化线性表
Status InitList(SqList& L)
{
	L.elem = new ElemType[MAXSIZE];
	if (!L.elem)exit(OVERFLOW);
	L.length = 0;
	return OK;
}

//销毁线性表L
void DestroyList(SqList& L)
{
	if (L.elem)delete L.elem;
}

//清空线性表L
void ClearList(SqList& L)
{
	L.length = 0;
}

//求线性表L的长度
int GetLength(SqList L)
{
	return (L.length);
}

//判断线性表L是否为空
int IsEmpty(SqList L)
{
	if (L.length == 0)return 1;
	else return 0;
}

//顺序表L的长度
int GetElem(SqList L, int i, ElemType& e)
{
	if (i<1 || i>L.length)return ERROR;
	e = L.elem[i - 1];
	return OK;
}

//顺序表L的查找
int LocateElem(SqList L, ElemType e)
{
	for (int i = 0; i < L.length; i++)
	{
		if (L.elem[i] == e)return i + 1;
	}
	return 0;
}

//顺序表L的插入
Status ListInsert_Sq(SqList &L,int i,ElemType e)
{
	if (i<1 || i>L.length + 1)return ERROR;
	if (L.length == MAXSIZE)return ERROR;
	for (int j = L.length - 1; j >= i - 1; j--)
		L.elem[j + 1] = L.elem[j];
	L.elem[i - 1] = e;
	L.length++;
	return OK;
 }

//顺序表L的删除
Status ListDelete_Sq(SqList &L,int i)
{
	if ((i < 1) || (i > L.length))return ERROR;
	for (int j = i; i <= L.length - 1; j++)
	L.elem[j - 1] = L.elem[j];
	L.length--;
	return OK;
 }
//主函数
int main()
{
	SqList L;
	return 0;
}

主函数可以自己添加上面一些操作。

时间空间复杂度：

优点缺点：为了克服这一缺点采用：链表