顺序链表的实现

#include<iostream>
#define Max 50

#define OK 1
using namespace std;
//顺序链表c语言版（a1,a2...an)
typedef int ElemType;
typedef struct //s顺序链表定义
{
    ElemType* elem;
    int length;
}ListLink;

int ListInit(ListLink&List)//顺序链表初始化
{
    List.elem = (ElemType*)malloc(sizeof(ElemType) * Max);
    if (!List.elem)//内存分配上失败退出程序
        exit(-1);
    List.length = 0;
    return OK;
}

ElemType ListGet(ListLink& List, int i)//得到顺序链表第i个位置元素
{
    if (i<1 || i>List.length)
        return false;
    return List.elem[i - 1];
}

bool ListInsert(ListLink& List, int i, ElemType data)//顺序链表在第i个位置插入元素data
{
    if (i<1 || i>List.length)
        return false;
    if (List.length >= Max)
        return false;
    for (int j = List.length ; j >= i; --j)
        List.elem[j] = List.elem[j-1];
    List.elem[i- 1] = data;
    ++List.length;
    return true;
}

bool ListInsertHead(ListLink& List, ElemType data)//在头部插入一个元素
{
    if (List.length >= Max)
        return false;
    for (int j = List.length-1; j >=0; --j)
    List.elem[j + 1] = List.elem[j];
    List.elem[0] = data;
    ++List.length;
    return true;
}

bool ListInsertEnd(ListLink& List, ElemType data)//在尾部插入一个元素
{
    if (List.length >= Max)
        return false;
    List.elem[List.length] = data;
    ++List.length;
    return true;
}

bool ListDeleteIndex(ListLink& List, int i)//按位置删除元素
{
    if (i<1 || i>List.length)
        return false;
    for (int j = i; j < List.length; ++j)
        List.elem[j - 1] = List.elem[j];
    --List.length;
    return true;
}

bool ListDeleteElem(ListLink& List, ElemType data)//按值删除元素
{
    for (int j = 0; j < List.length; ++j)
    {
        if (List.elem[j] == data)
        {
            for (int t = j; t < List.length-1; ++t)
                List.elem[t] = List.elem[t+1];
            --List.length;
            return true;
        }
    }
    return false;
}

void ListClear(ListLink& List)//删除顺序链表全部元素
{
    if (List.length)
    {
        for (int i = List.length-1; i >=0 ; --i)
        {
            List.elem[i-1] = List.elem[i];
            List.length--;
        }
    }
}

int ListLength(ListLink& List)//获取顺序链表长度
{
    return List.length;
}

bool ListFull(ListLink& List)//顺序链表是否为满
{
    return List.length == Max;

}

bool ListEmpty(ListLink& List)//顺序链表是否为空
{
    return List.length == 0;

}

void ListShow(ListLink& List)
{
    for (int i = 0; i < List.length; ++i)
        cout << List.elem[i] << "  ";
}

int main() {
    ListLink lis;
    ListInit(lis);
    cout << ListEmpty(lis) << endl;
    ListInsertHead(lis, 4);
    ListInsertHead(lis, 3);
    ListInsertHead(lis, 2);
    ListInsertEnd(lis, 7);
    ListInsertEnd(lis, 8);
    ListInsertEnd(lis, 9);
    ListInsert(lis, 4, 5);
    ListInsert(lis, 5, 6);
    ListShow(lis);
    cout << endl;
    ListDeleteIndex(lis, 3);
    ListShow(lis);
    cout << endl;
    ListDeleteElem(lis, 8);
    ListShow(lis);
    cout << endl;
    cout << ListLength(lis) << endl;
    ListClear(lis);
    cout << ListEmpty(lis) << endl;
    return 0;

}