【线性表】线性表的顺序存储结构

【线性表】线性表的顺序存储结构

代码

#include <iostream>
#include <cstdio>
using namespace std;
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef int status;
typedef int ElemType;
typedef struct {
    ElemType *elem;
    int length;
    int listsize;
}SqList;    //线性表的顺序表示和实现
status InitList_Sq(SqList &L){
    //初始化线性表L
    L.elem = (ElemType * )malloc(LIST_INIT_SIZE * sizeof(ElemType));
    L.length = 0;
    L.listsize = LIST_INIT_SIZE;
    return OK;
}
status ListInsert_Sq(SqList &L, int i, ElemType e){
    //插入元素
    if (i < 1 || i > L.length + 1) return ERROR;
    if (L.length >= L.listsize){
        ElemType * newbase = (ElemType * )realloc(L.elem, (LIST_INIT_SIZE + LISTINCREMENT) * sizeof(ElemType));
        L.elem = newbase;
        L.listsize += LISTINCREMENT;
    }
    ElemType * q = &(L.elem[i-1]);
    for (ElemType * p = &(L.elem[L.length-1]); p >= q; p--) *(p+1) = *p;
    *q = e;
    ++L.length;
    return OK;
}
status ListDelete_Sq(SqList &L, int i, ElemType &e){
    //删除元素
    if (i < 1 || i > L.length) return ERROR;
    ElemType * p = &(L.elem[i-1]);
    e = *p;
    ElemType * q = L.elem + L.length - 1;
    for (++p; p <= q; p++) *(p-1) = *p;
    --L.length;
    return OK;
}
int LocateElem_Sq(SqList L, ElemType e){
    //定位元素
    for (int i = 0; i < L.length; i++){
        if (L.elem[i] == e) return (i+1);
    }
    return 0;
}
void MergeList_Sq(SqList La, SqList Lb, SqList &Lc){
    //归并顺序线性表
    ElemType * pa = La.elem;
    ElemType * pb = Lb.elem;
    Lc.listsize = Lc.length = La.length + Lb.length;
    ElemType * pc = Lc.elem = (ElemType * )malloc(Lc.listsize * sizeof(ElemType));
    ElemType * pa_last = La.elem + La.length - 1;
    ElemType * pb_last = Lb.elem + Lb.length - 1;
    while (pa <= pa_last && pb <= pb_last){
        if (*pa <= *pb) *pc++ = *pa++;
        else *pc++ = *pb++;
    }
    while (pa <= pa_last) *pc++ = *pa++;
    while (pb <= pb_last) *pc++ = *pb++;
}
int main(){
    SqList La, Lb, Lc;
    InitList_Sq(La);
    InitList_Sq(Lb);
    InitList_Sq(Lc);    //初始化
    int n;
    printf("请输入第一个顺序线性表数据数量：\n");
    scanf("%d", &n);
    printf("请输入第一个顺序线性表数据：\n");
    for (int i = 0; i < n; i++){    //获取第一个顺序线性表数据
        scanf("%d", &La.elem[i]);
        La.length++;
    }
    printf("请输入第二个顺序线性表数据数量：\n");
    scanf("%d", &n);
    printf("请输入第二个顺序线性表数据：\n");
    for (int i = 0; i < n; i++){    //获取第二个顺序线性表数据
        scanf("%d", &Lb.elem[i]);
        Lb.length++;
    }
    /*
    printf("\n——————测试<一>——————\n");
    ListInsert_Sq(La, 4, 999);
    printf("插入后后的顺序线性表：\n");
    for (int i = 0; i < La.length; i++)
        printf("%d ", La.elem[i]);
    */
    
    /*
    printf("\n——————测试<二>——————\n");
    ElemType e;
    ListDelete_Sq(La, 4, e);
    printf("删除后的顺序线性表：\n");
    for (int i = 0; i < La.length; i++)
        printf("%d ", La.elem[i]);
    printf("\n被删除的元素是：%d\n", e);
    */
    
    /*
    printf("\n——————测试<三>——————\n");
    printf("想要定位的元素是：\n");
    ElemType e;
    scanf("%d", &e);
    printf("\n定位元素的位置是：%d\n", LocateElem_Sq(La, e));
    */
    
    /*
    printf("\n——————测试<四>——————\n");
    MergeList_Sq(La, Lb, Lc);
    printf("归并后的顺序线性表：\n");
    for (int i = 0; i < Lc.length; i++)
        printf("%d ", Lc.elem[i]);
    */
    return 0;
}