数据结构——顺序表及其操作

#include<iostream>

using namespace std;

#define MAXSIZE 100        //最大长度
#define OK 1
#define ERROR -1


//类型重命名
typedef int Elemtype;
typedef int Status;


//顺序表的存储结构
typedef struct 
{
    Elemtype *elem;        //基地址
    int length;            //顺序表长度
}SqList;                //顺序表的结构类型为SqList


//顺序表的初始化---即构造一个空的顺序表
Status InitList(SqList &L)
{
    L.elem = new Elemtype[MAXSIZE];        //为顺序表分配一个大小为MAXSIZE的数组空间

    if (!L.elem)
        return ERROR;        //存储分配失败退出

    L.length = 0;            //初始化为空表，长度为0

    return OK;
}


//顺序表的创建
Status CreateList(SqList &L)
{
    int a, i = 0;

    cin >> a;        //表元素的输入

    while (a != -1)
    {
        if (L.length == MAXSIZE)
        {
            cout << "顺序表已满！";
            return ERROR;
        }

        L.elem[i++] = a;
        L.length++;
        cin >> a;    //迭代输入顺序表元素
    }
    return OK;
}


//取值
//获取顺序表中第i个数据元素的值,赋值给e并返回
Status GetElem(SqList L, int i, Elemtype &e)
{
    //判断i值是否合理
    if (i<1 || i>L.length)
        return ERROR;

    e = L.elem[i - 1];    //elem[i-1]存储第i个数据元素 (注意是 i-1 ！！！

    return OK;
}


//查找
//查找顺序表中第1个与e相等的元素，若查找成功，则返回该元素在表中的位置序号
int LocateElem(SqList L, Elemtype e)
{
    int i;

    for (i = 0; i < L.length; i++)
    {
        if (L.elem[i] == e)        //查找成功，返回序号i+1 (注意位置序号是 i+1 ！！！
            return i + 1;
    }
    return ERROR;    //查找失败
}


//插入
//在表的第i个位置插入一个新的数据元素e
Status ListInsert(SqList &L, int i, Elemtype e)
{
    //判断i值是否合法 (注意此处是L.length + 1。因为插入一个元素后表长加1
    if( (i<1) || (i > L.length + 1) )
        return ERROR;

    if (L.length == MAXSIZE)    //溢出
        return ERROR;    

    for (int j = L.length - 1; j >= i - 1; j--)
    {
        L.elem[j + 1] = L.elem[j];    //从最后一个元素开始后移，直到第i个元素后移
    }

    L.elem[i - 1] = e;    //将新的数据元素放在第i个位置上
    L.length++;            //表长加1

    return OK;
}


//删除
//将表的第i个元素删除
Status ListDelete(SqList &L, int i, int &e)
{
    //判断i值是否合法
    if ((i < 1) || (i > L.length))
        return ERROR;

    e = L.elem[i - 1];    //将要删除的元素保留在e中，利于删除信息的找回

    for (int j = i; j <= L.length - 1; j++)
    {
        L.elem[j - 1] = L.elem[j];    //要删除元素之后的元素前移
    }

    L.length--;        //表长减1

    return OK;
}


//顺序表的输出
void print(SqList L)
{
    cout << "输出顺序表" << endl;
    for (int i = 0; i < L.length; i++)
    {
        cout << L.elem[i] << " ";
    }
    cout << "\n";
}


//顺序表的销毁
void DestroyList(SqList &L)
{
    if (L.elem)
        delete[]L.elem;
}


int main()
{
    SqList myL;
    int i, e;

    cout << "1. 初始化\n";

    cout << "2. 创建\n";

    cout << "3. 取值\n";

    cout << "4. 查找\n";

    cout << "5. 插入\n";

    cout << "6. 删除\n";

    cout << "7. 输出\n";

    cout << "8. 销毁\n";

    cout << "0. 退出\n";

    int choose = -1;

    while (choose != 0)
    {
        cout << "请选择:" << endl;

        cin >> choose;

        switch (choose)
        {
        case 1:    //初始化
            cout << "顺序表初始化..." << endl;

            if (InitList(myL))
                cout << "顺序表初始化成功！" << endl;

            else
                cout << "顺序表初始化失败！" << endl;

            break;

        case 2:    //创建
            cout << "顺序表创建..." << endl;

            cout << "输入整型数，输入-1结束" << endl;

            if (CreateList(myL))
                cout << "顺序表创建成功！" << endl;

            else
                cout << "顺序表创建失败！" << endl;

            break;

        case 3:    //取值
            cout << "输入整型数i，取第i个元素输出：" << endl;

            cin >> i;

            if (GetElem(myL, i, e))
                cout << "第i个元素是：" << e << endl;

            else
                cout << "取值失败！" << endl;

            break;
        case 4:    //查找
            cout << "请输入要查找的数e:";

            cin >> e;

            if (LocateElem(myL, e) == -1)
                cout << "查找失败！" << endl;

            else
            {
                cout << "查找成功！" << endl;
                cout << "查找数的位置为：" << LocateElem(myL, e) << endl;
            }

            break;
        case 5:    //插入
            cout << "请输入要插入的位置和要插入的数据元素值e：";

            cin >> i >> e;

            if (ListInsert(myL, i, e))
                cout << "插入成功！" << endl;

            else
                cout << "插入失败！" << endl;

            break;
        case 6:    //删除
            cout << "请输入要删除的位置i：";

            cin >> i;

            if (ListDelete(myL, i, e))
                cout << "删除成功！" << endl;

            else
                cout << "删除失败！" << endl;

            break;
        case 7:    //输出
            print(myL);

            break;
        case 8:    //销毁
            cout << "顺序表销毁..." << endl;

            DestroyList(myL);

            cout << "顺序表销毁成功！" << endl;
            break;
        }
    }
    return 0;
}