C语言顺序表

VSCode

#include 
#include 
#include 
using namespace std;

#define maxSize 100
typedef struct SqList
{
    /* data */
    int data[maxSize];
    int length;
} SqList;

void Print(SqList L)
{
    if (L.length == 0)
    {
        cout << "Empty" << endl;
        return;
    }
    for (int i = 0; i < L.length; ++i)
    {
        cout << L.data[i] << " ";
    }
    cout << endl;
    return;
}

void InitList(SqList &L)
{
    L.length = 0;
}

void Insert(SqList &L, int p, int e)
{
    if (p < 0 || p > L.length || L.length >= maxSize) //注意这里从0开始
    {
        cout << "1 position error" << endl;
        return;
    }
    for (int i = L.length - 1; i >= p; --i)
    {
        L.data[i + 1] = L.data[i];
    }
    L.data[p] = e;
    L.length++;

    return;
}

void Delete(SqList &L, int p)
{
    if (p < 0 || p > L.length - 1)
    {
        cout << "2 position error" << endl;
        return;
    }

    for (int i = p; i < L.length; ++i)
    {
        L.data[i] = L.data[i + 1];
    }
    L.length--;
    return;
}

//找到指定元素的位置
int FindElem(SqList L, int e)
{
    for (int i = 0; i < L.length; ++i)
    {
        if (L.data[i] == e)
        {
            return i;
        }
    }
    return 0;
}

//获取指定位置上的元素
int GetElem(SqList L, int p)
{
    if (p < 0 || p > L.length - 1)
    {
        cout << "3 position error" << endl;
        return 0;
    }

    return L.data[p];
}
int main()
{
    SqList L;

    InitList(L);
    Insert(L, 0, 1);
    Insert(L, 0, 2);
    Insert(L, 0, 3);
    Insert(L, 3, 4);
    Print(L);

    Delete(L, 1);
    Print(L);

    cout<