数据结构一 线性表的顺序存储结构

#include <stdio.h>

#define MAXSIZE 20
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

typedef int ElemType;
typedef int stauts;

typedef struct
{
ElemType data[MAXSIZE];
int length;
}SqList;

stauts GetElem(SqList L, int i, ElemType* e)
{
if (L.length == 0 || i < 1 || i > L.length)
{
return ERROR;
}

*e = L.data[i - 1];
return OK;
}

stauts ListInsert(SqList* L, int i, ElemType e)
{
int k;
if (L->length == MAXSIZE)
{
return ERROR;
}

if (i < 1 || i > L->length + 1)
{
return ERROR;
}

if (i <= L->length) //如果插入的元素不在末尾插入
{
for (k = L->length -1; k >= i-1; k--)
{
L->data[k+1] = L->data[k];
}
}

L->data[i-1] = e;
L->length++;
return OK;
}

stauts ListDelete(SqList* L, int i, ElemType* e)
{
int k;
if (L->length == 0)
{
return ERROR;
}

if (i < 1 || i > L->length)
{
return ERROR;
}

*e = L->data[i-1];
if (i < L->length)
{
for (k = i; k < L->length; k++)
{
L->data[k-1] == L->data[k];
}
}

L->length--;
return OK;
}