动态顺序表

动态顺序表

动态顺序表属性中采用指针基质方式设计，当原来的数组满了之后，
采用realloc函数重新分配一部分内存，让结构体的基址指针指向新的这部分扩容后的内容，
变相实现了顺序表的动态扩容

代码

#include <stdio.h>
#include "malloc.h"
#define MAX 100
#define increment_size 10


typedef struct DynSqeList{
    int* elem;
    int length;
    int max;
}DynSqeList;

void init(DynSqeList& L) {
    L.elem = (int*)malloc(sizeof(int) * 100);
    for (int i = 0; i < 10; i++)
    {
        L.elem[i] = i;
        L.length++;
    }
}

void insert(DynSqeList& L, int index, int value) {
    if (index<0 || index >L.length) {
        printf("插入索引值超过边界");
        return;
    }
    if (L.length == L.max) {
        int* NewArrayBase = (int*)realloc(L.elem, sizeof(int) * (L.length + increment_size));
        for (int i = 0; i < L.length; i++)
        {
            NewArrayBase[i] = L.elem[i];
        }
        L.elem = NewArrayBase;
        L.max = L.length + increment_size;
    }

    for (int i = L.length-1; i >= index; i--)
    {
        L.elem[i + 1] = L.elem[i];
    }
    L.elem[index] = value;
    L.length++;

}

void del(DynSqeList& L, int index) {
    if (index<0 || index>L.length) {
        printf("删除索引值超过边界");
        return;
    }
    for (int i = index; i < L.length-1; i++)
    {
        L.elem[i] = L.elem[i + 1];
    }
    L.length--;
}

void modify(DynSqeList& L, int index, int value) {
    if (index<0 || index>L.length) {
        printf("修改索引值超过边界");
        return;
    }
    L.elem[index] = value;
}

int select(DynSqeList& L, int index) {
    if (index<0 || index>L.length) {
        printf("查询索引值超过边界");
        return -1;
    }
    int  select_value = L.elem[index];
    return select_value;
    
}

void print(DynSqeList& L) {
    for (int i = 0; i < L.length-1; i++)
    {
        printf("%d", L.elem[i]);
    }
    printf("\n");
}

int main()
{
    DynSqeList L;
    L.length = 0;
    init(L);
    print(L);


    int insert_index = 0;
    int insert_value = 9;
    insert(L, insert_index, insert_value);
    print(L);

    int del_index = 0;
    del(L, del_index);
    print(L);


    int modify_index = 1;
    int modify_value = 9;
    modify(L, modify_index, modify_value);
    print(L);


    int select_index = 1;
    int select_value = select(L, select_index);
    printf("%d", select_value);


    return 0;
}

运行结果