1.1顺序表的基本操作

#include <stdlib.h> 
#include <stdio.h> 
#include <math.h> 
#define MAXSIZE 100
#define	OK 1
#define ERROR 0
typedef int Status; 
typedef int 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;
} 
Status GetElem(SqList L,int i,ElemType &e)//按位查找
{
	if (i<1||i>L.length) 
		return ERROR;
	e=L.elem[i-1];
	return OK;
}
int LocateElem(SqList L,ElemType e)//按值查找
{
	for (int i = 0; i < L.length; i++)
	if (L.elem[i] == e)
		return i+1;
	printf("找不到元素%d\n", e);
	return ERROR;
}
Status ListInsret(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; j >= i; j--)
	{
		L.elem[j] = L.elem[j-1];
	}
	L.elem[i-1] = e;
	L.length++;
	return OK;
}
Status ListDelete(SqList &L,int i)//删除操作
{
	if (i<1 || i>L.length+1)
		return ERROR;
	for (int j = i; j <= L.length; j++)
	{
		L.elem[j-1] = L.elem[j];
	}
	L.length--;
	return OK;
}
int main(){
	SqList L;
	int i;
	ElemType e;
	InitList(L);
	printf("请输入你要创建的顺序表的长度：");
	scanf("%d", &L.length);
	printf("请输入%d个你要放入顺序表里的元素：",L.length);
	for (int i = 0; i < L.length; i++){
		scanf("%d", &L.elem[i]);
	}
	for(int i = 0;i < L.length;i++){
		printf("%d",L.elem[i]);
	}
	printf("\n请输入要插入顺序表的元素和位置：");
	scanf("%d %d", &e, &i);
	ListInsret(L,i,e);
	printf("长度为：%d\n",L.length);
	printf("插入的元素是%d，插入的位置是%d\n", e, i);
	for(int i = 0; i < L.length;i++){
		printf("%d",L.elem[i]);
	}
	
	printf("\n请输入要删除的元素位置：");
	scanf("%d",&i);
	ListDelete(L,i); 
	for(int i = 0; i < L.length;i++){
		printf("%d",L.elem[i]);
	}
	
	printf("\n输入你要查找的元素值（数值）：");
	scanf("%d", &e);
	printf("找到了，是第%d个元素\n", LocateElem(L,e));

	printf("你要找第几个元素（位置）：");
	scanf("%d", &i);
	GetElem(L,i,e);
	printf("第%d位的数为：%d",i,e);
	return 0;
}