线性顺序表的实现

#include <iostream>  
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* list)
{
    list->elem = (Elemtype*)malloc(INIT_SIZE*sizeof(Elemtype));
    if (!list->elem)
    {
        return ERROR;
    }
    list->length = 0;
    list->size = INIT_SIZE;
    return OK;
}
//摧毁线性表
Status destroyList(SqList* list)
{
    free(list->elem);
    list->length = 0;
    list->size = 0;
    return OK;
}
//清空线性表
Status clearList(SqList* list)
{
    list->length = 0;
    return OK;
}
//判断是否为空
Status isEmpty(const SqList& list)
{
    if (0 == list.length)
    {
        return TRUE;
    }
    else
    {
        return FALSE;
    }
}
//获取线性表长度
Status getLength(const SqList& list)
{
    return list.length;
}

//获取线性表中第i个元素
Status getElem(const SqList& list, int i)
{
    if (i<1 || i>list.length)
        return ERROR;
    return list.elem[i - 1];
}

//比较两元素是否相等
Status compare(Elemtype i, Elemtype j)
{
    if (i == j)
    {
        return TRUE;
    }
    else
    {
        return FALSE;
    }
}

//查找元素
Status findElem(const SqList& list, Elemtype target, Status(*compare)(Elemtype, Elemtype))
{
    for (int i = 0; i < list.length;i++)
    {
        if ((*compare)(list.elem[i], target))
        {
            return i+1;
        }
    }
}

//查找某个元素的前驱元素，其中指针ptr用来存储这个前驱元素
Elemtype findPreElem(const SqList& list, Elemtype target)
{
    for (int i = 0; i < list.length; i++)
    {
        if (list.elem[i] == target)
        {
            if (i != 0)
            {
                return list.elem[i - 1];
            }
            else
            {
                return ERROR;
            }
        }

    }
}

//查找某个元素的后继元素，其中指针ptr用来存储这个后继元素
Elemtype findNextElem(const SqList& list, Elemtype target)
{
    for (int i = 0; i < list.length; i++)
    {
        if (list.elem[i] == target)
        {
            if (i < list.length-1)
            {
                return list.elem[i + 1];
            }
            else
            {
                return ERROR;
            }
        }

    }
}

//插入元素
//pos:插入元素的位置（从第1~list.length）
//target：插入的元素
Status insertElem(SqList* list, int pos, Elemtype target)
{
    Elemtype* newelem;
    if (pos<1 || pos>list->length+1)//这里为什么要+1？！因为POS插入元素的位置是从1开始而不是从0开始的。
    {
        return ERROR;
    }
    if(list->length>=list->size)
    {
        //扩展内存
        newelem = (Elemtype*)realloc(list->elem, (list->size + INCREMENT_SIZE)*sizeof(Elemtype));
        if (!newelem)
        {
            return ERROR;
        }
        list->elem = newelem;
        list->size += INCREMENT_SIZE;
    }
    Elemtype* begin = &list->elem[pos- 1];
    Elemtype* end = &list->elem[list->length];
    for (; end>=begin; end--)
    {
        *(begin + 1)=*begin;
    }
    *begin = target;
    ++list->length;
    return OK;
}

//删除元素并返回删除的值
//pos:插入元素的位置（从第1~list.length）
Elemtype deleteElem(SqList* list, int pos)
{
    Elemtype returnValue;
    if (pos<1 || pos>list->length)
    {
        return ERROR;
    }
    returnValue = list->elem[pos - 1];
    Elemtype *ptr = &list->elem[pos - 1];
    for (; ptr < (&list->elem[list->length]); ptr++)//length-1?
    {
        *ptr=*(ptr+1);
    }
    return returnValue;
}

//遍历线性表
Status traverseElem(const SqList& list)
{
    for (int i = 0; i < list.length; i++)
    {
        printf("%d", list.elem[i]);
    }
    return OK;
}

int main()
{
    //构造线性表
    SqList myList;
    //初始化线性表
    if (!initList(&myList))
    {
        printf("something wrong happen in initialize");
    }
    //插入元素
    for (int i = 0; i < 10; i++)
    {
        insertElem(&myList, i + 1, 100-i);
        printf("%d\n", myList.elem[i]);
    }
    //获取线性表长度
    printf("current element length : %d\n", getLength(myList));
    //输入具体的下标获取元素
    int input;
    printf("input a num(1~10) to get element you want:");
    scanf("%d", &input);
    //通过键入的下标获取线性表的元素
    printf("the NO.%d element you want is:%d\n", input,getElem(myList, input));
    //判断线性表是否为空
    if (isEmpty(myList))
    {
        printf("list is empty!");
    }
    //找出元素为95的位置
    printf("location of 95 is lie in %d\n",findElem(myList,95,compare));
    //找出95的前驱元素
    printf("factor 95's pre element is %d\n", findPreElem(myList, 95));
    //找出95的后继元素
    printf("factor 95's next element is %d\n", findNextElem(myList, 95));

}