#include<stdio.h>
#include<stdlib.h>
#define MAXsize 100
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(-2);//存储分配失败
l.length = 0;//空表长度为0
return 1;
}
void destroy(Sqlist& l) {
if (l.elem)delete l.elem;//释放存储空间
}
void clear_list(Sqlist& l) {
l.length = 0;//将长度设置为0
}
int getLength(Sqlist& l) {
return l.length;
}
//根据位置i获取相应位置数据元素的内容
int getElem(Sqlist& l, int i, ElemType& e) {
if (i<1 || i>l.length)return 0;//判断i值是否合理
e = l.elem[i - 1];
return 1;
}
int locateelem(Sqlist l, ElemType e) {
for (int i = 0; i < l.length; i++) {
if (l.elem[i] == e)return i + 1;
}
return 0;
}
Status Listinsert(Sqlist& l, int i, ElemType e) {
if (i<1 || i>l.length+1)return 0;
if (l.length == MAXsize)return 0;
for (int j = l.length; j >= i; j--) {
l.elem[j] = l.elem[j - 1];
}
l.elem[i] = e;
l.length++;
return 1;
}
Status ListDelete(Sqlist& l, int i) {
if (i<1 || i>l.length)return 0;
for (int j = i; j < l.length; j++) {
l.elem[j - 1] = l.elem[j];
}
l.length--;
return 1;
}