【数据结构】顺序表（数组）增、删、改、查

源码

#include <stdio.h>
#include <stdlib.h>

typedef int E; // 定义数组所存数据类型

// 数组结构
struct List {
    E * array;
    int capacity; // 数组容量
    int size; // 长度
};

typedef struct List * ArrayList;

// 数组初始化
int initList(ArrayList list) {
    list->array = malloc(sizeof(E) * 10); // 动态申请内存
    if (list->array == NULL) return 0; // 申请内存失败返回 0
    list->capacity = 10;
    list->size = 0;
    return 1;
}

// 数组 - 插入
int insertList(ArrayList list, E element, int index) {
    if (index > list->size + 1 || index < 1) return 0; // 判断插入位置是否合法

    // 数组动态增加
    if (list->size == list->capacity) {
        int newCapacity = list->capacity + (list->capacity >> 1);
        E * newArray = realloc(list->array, newCapacity * sizeof(E));
        if (newArray == NULL) return 0;
        list->array = newArray;
        list->capacity = newCapacity;
    }

    for (int i = list->size; i > index - 1; i--) {
        list->array[i]= list->array[i - 1];
    }

    list->array[index - 1] = element;
    list->size++;

    return 1;
}

// 数组 - 删除
int deleteList(ArrayList list,int index) {
    if (index < 1 || index > list->size) return 0;
    int deleteNum = list->array[index - 1];
    for (int i = index - 1; i < list->size; i++) {
        list->array[i] = list->array[i + 1];
        list->size--;
    }

    return deleteNum;
}

// 数组 - 获取长度
int sizeList(ArrayList list) {
    return list->size;
}

// 数组 - 获取指定位置的元素
E * getListElement(ArrayList list, int index) {
    if (index < 1 || index > list->size) return NULL;

    return &list->array[index - 1];
}

// 数组 - 返回指定元素的位置
int findListElement(ArrayList list, E element) {
    for (int i = 0; i < list->size; i++ ) {
        if (list->array[i] == element) return i + 1;
        return -1;
    }
}

// 数组 - 打印
void printList(ArrayList list) {
    for (int i = 0; i < list->size; i++) {
        printf("%d ", list->array[i]);
    }
    printf("\n");
}

int main(void) {
    struct List list;
    if (initList(&list)) {

        for (int i = 0; i < 10; i++) {
            insertList(&list, i + 1, i + 1);
        }
        // deleteList(&list, 10);
        printList(&list);
        // printf("%d\n", list.capacity);
        printf("%d\n", *getListElement(&list, 10));
        printf("%d", findListElement(&list, 100));

    }else {
        printf("顺序表初始化失败，无法启动！");
    }
    free(&list); // 释放内存
}