线性表的增删cpp实现（Clion）

 

#include <iostream>

using namespace std;
typedef int ElementType;
#define MaxSize 50

typedef struct SeqList {
    ElementType data[MaxSize];
    int length;
} Seq;

bool init(Seq *L) {
    L->length = MaxSize - 3; //顺序初始化前47个元素
    for (int i = 0; i < MaxSize - 3; ++i) {
        L->data[i] = i;
    }
    return true;
}

Seq *createSeq(int size) {
    Seq *L = (Seq *) malloc(sizeof(ElementType) * size);
    L->length = 10;
    L->data[9] = 9;
    return L;
}

bool insertEle(Seq *L, ElementType e, int loc) {
    if (loc < 1 || loc > L->length + 1) return false;
    else {
        for (int i = L->length; i >= loc; --i) {
            L->data[i] = L->data[i - 1];
        }
        L->data[loc - 1] = e;
        L->length++;
    }
    return true;
}


ElementType popEle(Seq *L, int loc) {
    ElementType e = L->data[loc -