顺序存储的类型表述

线性表

顺序存储的类型表述

/* 顺序表: sequence list
 * 动态分配
 */
#include<stdio.h>
#include <math.h>
#define InitSize 100

typedef struct {
    int *data;
    int length;
    int MaxSize;
}SqList;

/*初始化*/
bool InitList(SqList &L) {
    L.data = (int *)malloc(InitSize * sizeof(int));
    if (L.data == nullptr)
        return false;
    L.length = 0;
    L.MaxSize = InitSize;
    return true;
}

/*扩容*/
bool IncreaseSize(SqList &L, int len) {
    int *p = L.data;
    L.data = (int *) malloc((L.length + len) * sizeof(int));
    if (L.data == nullptr)
        return false;
    for (int i = 0; i < L.length; ++i) {
        L.data[i] = p[i];
    }
    L.MaxSize = L.MaxSize + len;
    free(p);
    return true;
}

/*将elem元素插入位序为order的地方*/
bool ListInsert(SqList &L, int order, int elem) {
    if (order < 1 || order > L.length + 1)           //判断order的取值范围是否有效
        return false;
    if (L.length >= L.MaxSize)                       //当前存储空间已满，不能插入
        return false;
    for (int i = L.length; i >= order; --i) {        //将将第order个元素及之后元素后移
        L.data[i] = L.data[i-1];
    }
    L.data[order-1] = elem;
    L.length++;
    return true;
}

/*将位序order的元素删除，并将值传给elem*/
bool ListDelete(SqList &L, int order, int &elem) {
    if (order < 1 || order > L.length)                 //判断order的取值是否有效
        return false;
    elem = L.data[order-1];                            //将第order个元素赋值给elem
    for (int i = order; i < L.length; ++i) {           //将第order个后面的元素前移
        L.data[i-1] = L.data[i];
    }
    L.length--;
    return true;
}

/*根据元素elem，查找位序*/
int LocateElem(SqList &L, int elem) {
    for (int i = 0; i < L.length; ++i) {
        if (L.data[i] == elem)
            return i + 1;       //下标为i，位序为i+1
    }
    return -1;                  //查找失败，返回-1
}

/*根据位序，查找元素*/
int GetElem(SqList L, int order) {
    return L.data[order-1];
}

/*打印顺序表*/
void ListPrint(SqList &L) {
    for (int i=0; i<L.length; ++i) {
        printf("下标%3d  位序%3d : %d\n", i, i+1, L.data[i]);
    }
}