数据结构顺序表实现

#include <iostream>
using namespace std;

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OK 1
#define ERROR -1
typedef int Status;
typedef int ElemType;
typedef struct
{
	ElemType* elem;
	int length;
	int listsize;
}Sqlist;

Status InitList(Sqlist& L)//初始化线性表
{
	//L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));//第一种使用malloc分配空间
	L.elem = new ElemType[LIST_INIT_SIZE];//第二种使用new分配空间，注意区分两者的不同
	if (!L.elem) exit(OVERFLOW);
	L.length = 0;
	L.listsize = LIST_INIT_SIZE;
	return OK;
}

Status GetElem(Sqlist& L, int i, ElemType& e)//读取线性表中的值
{
	if ((i < 0) || (i > L.length)) return ERROR;
	e = L.elem[i - 1];
	return OK;
}

int LocateElem(Sqlist& L, int i, ElemType e)//查找线性表中元素的位置//注意这里是用int 
{
	if ((i < 0) || (i > L.length)) return ERROR;
	for (int i = 0; i < L.length - 1; i--)
	{
		if (L.elem[i] == e)
			return i + 1;
	}

	return 0;
}


Status ListInsert(Sqlist& L, int i, ElemType e)//注意这里没有引用e
{
	if ((i < 1) || (i > L.length + 1)) return ERROR;
	if (L.length >= L.listsize) return ERROR;//判断存储空间是否已满，若满了，下面的操作便是增加容量
	ElemType* newbase = (ElemType*)realloc(L.elem, (L.listsize + LISTINCREMENT) * sizeof(ElemType));
	if (!newbase) return ERROR;
	L.elem = newbase;
	L.listsize += LISTINCREMENT;

	//进行插入操作
	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;
	
}

Status Listdelete(Sqlist& L, int i, ElemType e)//删除第i个位置，并返回其值
{
	if ((i < 1) || (i > L.length)) return ERROR;
	e = L.elem[i - 1];
	for (int j = i; j <= L.length - 1; j++)
	{
		L.elem[j - 1] = L.elem[j];
		--L.length;
	}
	return OK;

}

void PrintList(Sqlist& L)
{
	int n = L.length;
	for (int i = 0; i < n; i++)
	{
		ElemType e;
		GetElem(L, i + 1, e);//调用GetElem函数,将每个值给e
		cout << e << " ";
	}
	cout << endl;
}


int main()
{
	Sqlist La, Lb, Lc;
	InitList(La);
	InitList(Lb);
	InitList(Lc);
	int a[] = { 1,-7,-4,9,8 };
	int b[] = { 8,-3,9,-6,7,};
	int na = sizeof(a) / sizeof(int);//求出数组a,b中元素的个数
	int nb = sizeof(b) / sizeof(int);
	for (int i = 0; i < na; i++) ListInsert(La, i, a[i]);
	for (int j = 0; j < nb; j++) ListInsert(Lb, j, b[j]);
	PrintList(La);
	PrintList(Lb);
	//PrintList(Lc);

	return 0;


}