数据结构-线性表_顺序表

#include<iostream>
#include<cstdlib>

using namespace std;


#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INIT_SIZE 10        //初始化表长
#define INCREMENT_SIZE 5    //分配增量

typedef int Status;
typedef int Elemtype;

/*
 * 存储结构
 */
typedef struct
{
    Elemtype* elem;    //存储空间基址
    int length;        //当前长度
    int size;        //当前分配的表长大小
}SqList;

/*
 * 初始化一个空的线性表
 */
Status InitList(SqList* L)
{
    L->elem = (Elemtype*)malloc(INIT_SIZE * sizeof(Elemtype)); //分配空间
    if (!L->elem)            //分配成功不为空
    {
        return ERROR;
    }
    L->length = 0;
    L->size = INIT_SIZE;
    return OK;
}

/*
 * 销毁线性表
 */
Status DestroyList(SqList* L)
{
    free(L->elem);            //c语言释放空间
    L->length = 0;
    L->size = 0;
    return OK;
}

/*
 * 清空线性表
 */
Status ClearList(SqList* L)
{
    L->length = 0;
    return OK;
}

/*
 * 判断线性表是否为空
 */
Status isEmpty(const SqList L)
{
    if (0 == L.length)        //为空则length为0
    {
        return TRUE;
    }
    else
    {
        return FALSE;
    }
}

/*
 * 获取长度
 */
Status getLength(const SqList L)
{
    return L.length;
}

/*
 * 根据位置获取元素
 */
Status GetElem(const SqList L, int i, Elemtype* e)
{
    if (i < 1 || i > L.length)        //输入位置在序列外界
    {
        return ERROR;
    }
    *e = L.elem[i - 1];
    return OK;
}

/*
 * 比较两个元素是否相等
 */
Status compare(Elemtype e1, Elemtype e2)
{
    if (e1 == e2)
    {
        return 0;
    }
    else if (e1 < e2)
    {
        return -1;
    }
    else
    {
        return 1;
    }
}

/*
 * 查找元素
 */
Status FindElem(const SqList L, Elemtype e)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        if (!(*compare)(L.elem[i], e))
        {
            return i + 1;
        }
    }
    if (i >= L.length)
    {
        return ERROR;
    }
}

/*
 * 查找前驱元素
 */
Status PreElem(const SqList L, Elemtype cur_e, Elemtype* pre_e)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        if (cur_e == L.elem[i])
        {
            if (i != 0)        //若是第一个则无前驱
            {
                *pre_e = L.elem[i - 1];
            }
            else
            {
                return ERROR;
            }
        }
    }
    if (i >= L.length)        //完全遍历也没找到
    {
        return ERROR;
    }
}

/*
 * 查找后继元素
 */
Status NextElem(const SqList L, Elemtype cur_e, Elemtype* next_e)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        if (cur_e == L.elem[i])
        {
            if (i < L.length - 1)        //若是最后一个则无后驱
            {
                *next_e = L.elem[i + 1];
                return OK;
            }
            else
            {
                return ERROR;
            }
        }
    }
    if (i >= L.length)                    //完全遍历也没找到
    {
        return ERROR;
    }
}

/*
 * 插入元素
 */
Status InsertElem(SqList* L, int i, Elemtype e)
{
    Elemtype* nuw;
    if (i < 1 || i > L->length + 1)        //只能在序列区域及后一个插入
    {
        return ERROR;
    }
    if (L->length >= L->size)            //判断当前空间是否已满
    {
        nuw = (Elemtype*)realloc(L->elem, (L->size + INCREMENT_SIZE) * sizeof(Elemtype));    //追加空间
        if (!nuw)                //追加成功为不为NIULL
        {
            return ERROR;
        }
        L->elem = nuw;
        L->size += INCREMENT_SIZE;
    }
    if (i - 1 == L->length) {
        L->elem[L->length] = e;
    }
    else {
        Elemtype* p = &L->elem[i - 1];
        Elemtype* q = &L->elem[L->length - 1];
        for (; q >= p; q--)
        {
            *(q + 1) = *(q);
        }
        *p = e;
    }
    ++L->length;
    return OK;
}

/*
 * 删除元素并返回其值
 */
Status DeleteElem(SqList* L, int i, Elemtype* e)
{
    if (i < 1 || i > L->length)        //不在范围之内
    {
        return ERROR;
    }
    Elemtype* p = &L->elem[i - 1];
    *e = *p;
    for (++p; p < &L->elem[L->length]; p++)
    {
        *(p - 1) = *(p);
    }
    --L->length;
    return OK;
}

/*
 * 访问元素
 */
void visit(Elemtype e)
{
    cout << e << " ";
}

/*
 * 遍历线性表
 */
Status TraverseList(const SqList L)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        visit(L.elem[i]);
    }
    return OK;
}

/*
 * 主函数测试
 */
int main()
{
    SqList L;
    if (InitList(&L))
    {
        Elemtype e;
        cout << "init_success" << endl;
        int i;
        for (i = 0; i < 10; i++)
        {
            InsertElem(&L, i + 1, i);
        }
        TraverseList(L/*, visit*/);
        cout << "length is " << getLength(L) << endl;
        if (GetElem(L, 1, &e)) {
            cout << "The first element is " << e << endl;
        }
        else
        {
            cout << "element is not exist" << endl;
        }
        if (isEmpty(L))
        {
            cout << "list is empty" << endl;
        }
        else
        {
            cout << "list is not empty" << endl;
        }
        cout << "The 5 at " << FindElem(L, 5) << endl;
        PreElem(L, 6, &e);
        cout << "The 6‘s previous element is " << e << endl;
        NextElem(L, 6, &e);
        cout << "The 6‘s next element is " << e << endl;
        DeleteElem(&L, 1, &e);
        cout << "delete first element is " << e << endl;
        cout << "list:";
        TraverseList(L);
        if (DestroyList(&L))
        {
            cout << endl << "destroy_success" << endl;
        }
    }
}