线性表的简单实现

#define INCREASEMENT 10

//线性表
typedef struct
{
    int* base;
    int length;
    int size;
} Mylist;

void initlist(Mylist& list, int size)
{
    list.base = (int*)malloc(size * sizeof(int));
    list.size = size;
    list.length = 0;
}

int insert(Mylist& list, int e, int p)//e为插入的元素，p为位址
{
    if (p<0 || p>list.length)
    {
        cout << "插入位置错误" << endl;
        return -1;
    }
    if (list.length == list.size)
    {
        if (list.base == NULL)
            return -1;
        list.base = (int*)realloc(list.base, (INCREASEMENT + list.size) * sizeof(int));
        list.size += INCREASEMENT;
    }
    for (int i = list.length - 1; i >= p; i--)
        list.base[i + 1] = list.base[i];
    list.base[p] = e;
    list.length++;
}

void showlist(Mylist list)
{
    for (int i = 0; i < list.length; i++)
        cout << list.base[i] << endl;
}

int  insertend(Mylist& l, int i) 
{
    if (l.length == l.size)
    {
        l.base = (int*)realloc(l.base, (INCREASEMENT + l.size) * sizeof(int));
        l.size += INCREASEMENT;
    }
    l.base[l.length] = i;
    l.length++;
    return 1;
}

int  deleteone(Mylist& list, int e)
{
    if (list.base == NULL)return -1;
    int i = 0;
    while (list.base[i++] != e);
    for (; i != list.length; i++)
        list.base[i - 1] = list.base[i];
    list.length--;
    return 0;
}


void main()
{
    Mylist list;
    initlist(list,5);
    insertend(list, 1);
    insertend(list, 2);
    insertend(list, 3);
    insertend(list, 4);
    insertend(list, 5);
    insertend(list, 6);
    insert(list, 11, 6);
    deleteone(list, 1);
    deleteone(list, 6);
    showlist(list);
    cout << list.length<<endl;
    cout << list.size;
}