线性表顺序结构的实现

#include <stdio.h>
/*2013-06-19 liuwei*/
typedef int elemtype ;

#define MAXSIZE 100
#define LISTSIZEINCREASE 10
#define OK 0
#define ERROR -1

//线性表顺序存储结构描述


typedef struct
{
    elemtype *elem;
    int length;
    int listsize;
} SqList;

/*顺序线性表的操作基本操作*/

//1.初始化顺序表数据结构
int InitList_Sq(SqList& L)
{
    L.elem = (elemtype*)malloc(sizeof(elemtype) * MAXSIZE);
    if (!L.elem)
    {
        return -1;        
    }
    L.length = 0
    L.listsize = MAXSIZE;
    return 0;
}

//2.初始化的相反操作，摧毁整个顺序表

int DestoryList_Sq(SqList &L)
{
    if (L.elem)
    {
        free(L.elem);
        L.elem = NULL;
    }
    L.length = 0;
    return OK;
}

//3.向顺序表中的第i个位置插入数据元素

int ListInsert_Sq(SqList& L,int i,elemtype  e) 
{

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

    if(L.length >= L.listsize)
    {
        elemtype *newbase = (elemtype*)realloc(L.elem,(L.listsize + LISTSIZEINCREASE)*sizeof(elemtype));

        if (!newbase)
        {
            return ERROR;
        }
        L.elem = newbase;
        L.listsize += LISTSIZEINCREASE;
    }

    elemtype *p = &L.elem[L.length - 1];
    elemtype *q = &L.elem[i - 1];
    for (;p <= q;--p)
    {
        *(p+1) = *p;
    }
    *q = e;
    ++L.length;
    return OK;
}

//4.删除顺序表中第i个数据元素

int DeleteList_Sq(SqList& L,int i)
{

    if (i < 1 || i > L.length)
    {
        return ERROR;
    }
    elemtype *p = &L.elem[i - 1];
    elemtype *q = &L.elem[L.length -1];
    for (;p < q;++p)
    {
        *p = *(p+1);
    }
    --L.length;
    return OK;
}

//5.清空顺序表中所有的数据元素

int ClearList_Sq(SqList& L)
{
    L.length = 0;
    return OK;
}

//6.判断顺序表中的数据元素是否为空，若为空则返回true，若不会空则返回false
bool IsEmptyList_Sq(SqList L)
{
    if (L.length == 0)
    {
        return true;
    }
        return false;
}

//7 取得顺序表中的第i个数据元素
elemtype GetElem_Sq(SqList L,int i)
{
    if (i < 1|| i > L.length)
    {
        return ERROR;
    }
    return L.elem[i-1];

}

//8.判断数据元素是否在线性表中,若在则返回第一次出现的位置，若不在则返回错误

int LocateList_Sq(SqList L,elemtype e)
{
    int i = 0;
    for (;i < L.length;++i)
    {
        if (L.elem[i] == e)
        {
            return i + 1;
        }
    }
    return ERROR;
}

//9.求数据元素的前驱

elemtype PriorList_Sq(SqList L,int i)
{
    if (i < 2 || i > L.length)
    {
        return ERROR;
    }
    else
        return L.elem[i-1];
}

//10.求数据元素的后继

elemtype NextList_Sq(SqList L,int i)
{
    if (i < 1 || i > L.length - 1)
    {
        return ERROR;
    }
    else
        return L.elem[i + 1];
}

 注意：