顺序表

#include <iostream>
#define InitSize 10

typedef struct
{
    int *data;
    int MaxSize;
    int length;

}SeqList ;

//初始化
void InitList(SeqList& L)
{
    L.data = (int*)malloc(InitSize * sizeof(int));
    L.length = 0;
    L.MaxSize = InitSize;
}

//动态增加数组长度
void IncressSize(SeqList &L ,int len)
{
    int* p = L.data;
    L.data = (int*)malloc((L.MaxSize + len) * sizeof(int));
    for (int i = 0; i < L.length; i++)
    {
        L.data[i] = p[i]; //将数据复制
    }
    
    L.MaxSize = L.MaxSize + len;
    free(p);
}

//插入操作：在第i个位置插入元素e
bool ListInsert(SeqList& L, int i, int e)
{
    if (i<1 || i>L.length + 1) return false;
    if (L.length >= L.MaxSize) return false;
    
    for (int j = L.length; j >= i; j--)
    {
        L.data[j] = L.data[j - 1];
        
    }
    L.data[i - 1] = e;
    L.length++;
    return true;

}

//删除操作:删除第i个元素，第i个元素为e
bool ListDelete(SeqList& L, int i, int&& e)
{
    if (i<1 || i>L.length) return false;
    e = L.data[i - 1];

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

    return true;


}

//查找:查找第为序为i的元素并返回它的值
int GetElem(SeqList L, int i)
{
    return L.data[i - 1];
}

//查找第一个为元素等于e的元素，并返回其位序
int LocateElem(SeqList L, int e)
{
    for (int i = 0; i < L.length; i++)
    {
        if (L.data[i] == e)
        {
            return i + 1;
        }
    }
    return 0;

}

int main()
{
    SeqList L;
    InitList(L);
    
    ListInsert(L, 1, 1);
    ListInsert(L, 2, 2);
    ListInsert(L, 3, 3);

    for (int i = 0; i < L.length; i++)
    {
        std::cout << L.data[i] << std::endl;
    }

    ListDelete(L, 2, 0);
    for (int i = 0; i < L.length; i++)
    {
        std::cout << L.data[i] << std::endl;
    }

}