C语言线性表-顺序表操作【转】

#include <stdio.h>
#include <stdlib.h>

#define OK        1
#define ERROR    0
#define TRUE    1
#define FALSE    0
#define MAXLEN    100

typedef int elemType;
typedef struct {
    elemType *data;
    int len;
}LIST;

//初始化线性表
int initList(LIST *L)
{
    L->data = (elemType *)malloc(MAXLEN * sizeof(elemType));
    if (L->data == NULL) return ERROR;
    L->len = 0;
    return OK;
}

//销毁线性表
void destoryList(LIST *L)
{
    if (L->data) free(L->data);
}

//清空线性表
void clearList(LIST *L)
{
    L->len = 0;
}

//返回线性表长度
int lengthList(LIST *L)
{
    return L->len;
}

int isEmptyList(LIST *L)
{
    if (L->len == 0) return TRUE;
    else return FALSE;
}

void printList(LIST *L)
{
    int i;
    for (i = 0; i < L->len; i++)
        printf("%d ", L->data[i]);
    printf("
");
}

//在表头插入元素
int insertAtHead(LIST *L, elemType x)
{
    int i;
    if (L->len == MAXLEN) return ERROR;
    for (i = L->len; i > 0; i--)
        L->data[i] = L->data[i-1];
    L->data[0] = x;
    L->len++;
    return OK;
}

//在表尾插入元素
int insertAtEnd(LIST *L, elemType x)
{
    if (L->len == MAXLEN) return ERROR;
    L->data[L->len] = x;
    L->len++;
    return OK;
}

//在指定索引后插入元素
int insertAfterIndex(LIST *L, elemType x, int index)
{
    int i;
    if (L->len == MAXLEN) return ERROR;
    for (i = L->len + 1; i > index + 1; i++)
        L->data[i] = L->data[i-1];
    L->data[index+1] = x;
    L->len++;
    return OK;
}

//删除指定索引处的元素
int deleteIndexElem(LIST *L, int index)
{
    int i;
    if (index < 0 || index >= L->len) return ERROR;
    for (i = index; i < L->len - 1; i++)
        L->data[i] = L->data[i+1];
    L->len--;
    return OK;
}


//修改指定索引处的元素
int updateIndexElem(LIST *L, int index, elemType x)
{
    if (index >= 0 && index < L->len)
    {
        L->data[index] = x;
        return OK;
    }
    else return ERROR;
}

//返回指定处的元素
elemType getPosElem(LIST *L, int index)
{
    if (index < 0 || index >= L->len) return ERROR;
    return L->data[index];
}

//返回某元素的索引
int indexList(LIST *L, elemType x)
{
    int i;
    for (i = 0; i < L->len; i++)
        if (L->data[i] == x)
            return i;
    return ERROR;
}