数据结构一线性表

#include<iostream>
#include<string>
using namespace std;
#define MAXSIZE 100
#define OVERFLOW -2

typedef struct{
    int *elem;
    int length;
}Sqlist;

int Init_Sq(Sqlist &L)//初始化线性表
{
    L.elem = new int[MAXSIZE];
    if(L.elem == nullptr)
    {
        exit(OVERFLOW);
    }
    L.length = 0;
    return 1;
}

void Destory_Sq(Sqlist &L)//销毁线性表
{
    if(L.elem != nullptr)
    {
        delete[] L.elem;
    }
}

void Clear_Sq(Sqlist &L)//清空线性表
{
    L.length = 0;
}

int GetLength_Sq(Sqlist &L)//获取线性表的长度
{
    return L.length;
}

int IsEmpty_Sq(Sqlist &L)//判断线性表是否为空
{
    if(L.length == 0)
    {
        cout << "线性表为空" << endl;
        return 1;
    }
    else
    {
        cout << "线性表不为空" << endl;
        return 0;
    }
}

int GetElem(Sqlist &L, int i)//根据位置i获取相应位置元素的内容
{
    if(i < 1 || i > L.length)
    {
        return -1;
    }
    return L.elem[i-1];
}

int Locate_Sq(Sqlist &L, int e)//在线性表L中查找值为e的元素，返回其序号（是第几个元素）
{
    for(int i = 0; i < L.length; i++)
    {
        if(L.elem[i] == e)
        {
            return i + 1;
        }
    }
    return 0;
}

int ListInsert_Sq(Sqlist &L, int i, int e)//插入元素
{
    if(i < 1 || i > L.length + 1)
    {
        return -1;
    }
    if(L.length == MAXSIZE)
    {
        cout << "线性表已满，不能插入新数据" << endl;
        return -1;
    }
    for(int j = L.length - 1; j >= i - 1; j--)
    {
        L.elem[j + 1] = L.elem[j];
    }
    L.elem[i - 1] = e;
    L.length++;
    return i;
}
int ListDelete_Sq(Sqlist &L,int i)//删除某元素
{
    if(i<1||i>L.length)
    {
        cout<<"i值不合法"<<endl;
        return -1;
        
    }
    for(int j=i;j<=L.length-1;j++)
    {
        L.elem[j-1] = L.elem[j];
    }
    L.length--;
    return i;
}


int main()
{
    Sqlist L;
    Init_Sq(L);

    // 初始化线性表的元素
    for(int i = 0; i < 10; i++)
    {
        L.elem[i] = i + 1;
        L.length++;
    }

    for(int i = 0; i < L.length; i++)
    {
        cout << L.elem[i] << " ";
    }
    cout << endl;
    cout << "--------------------------------------------" << endl;
    cout << "根据位置i获取相应位置元素的内容为: " << GetElem(L, 5) << endl;
    cout << "--------------------------------------------" << endl;
    cout << "在线性表L中查找值为e的元素，返回其序号（是第几个元素）: " << Locate_Sq(L, 5) << endl;
    cout << "--------------------------------------------" << endl;
    cout << "插入到第" << ListInsert_Sq(L, 5, 100)<<"号元素" << endl;
    for(int i = 0; i < L.length; i++)
    {
        cout << L.elem[i] << " ";
    }
    cout << endl;
    cout << "--------------------------------------------" << endl;
    cout<<"删除第"<<ListDelete_Sq(L,3)<<"号"<<"元素"<<endl;
    for(int i = 0; i < L.length; i++)
    {
        cout << L.elem[i] << " ";
    }
    cout << endl;

    Destory_Sq(L);
    return 0;
}