静态顺序表

静态顺序表

声明的结构体属性中，直接采用数组，因此能实现直接定位，但也正因为是数组，导致不能扩容。只能静态使用

源码

#include "stdio.h"
#define MAX 100

typedef struct SqeList
{
    int elem[MAX];
    int length;
}SqeList;

void init(SqeList& L) {
    for (int i = 0; i < 10; i++)
    {
        L.elem[i] = i;
        L.length++;
    }
}

void insert(SqeList& L,int index,int value) {
    if (index < 0 || index >L.length) {
        printf("插入索引位置超出边界");
        return;
    }
    if (L.length == MAX) {
        printf("静态数组已满，无法再插入元素");
        return;
    }
    for (int i = L.length-1; i >= index; i--)
    {
        L.elem[i + 1] = L.elem[i];
     }
    L.elem[index] = value;
    L.length++;
}

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


void modify(SqeList& L,int index, int value) {
    if (index < 0 || index > L.length-1) {
        printf("修改索引位置超出边界");
        return;
    }
    L.elem[index] = value;
}

int select(SqeList& L, int index) {
    if (index < 0 || index > L.length - 1) {
        printf("查询索引位置超出边界");
        return -1;
    }
    int value = L.elem[index];
    return value;
}

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

int main()
{
    SqeList 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 = 1;
    del(L, del_index);
    print(L);


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


    int select_index = 9;
    int select_value = select(L, select_index);
    printf("%d",select_value);
    return 0;
}

运行效果图