第二章 线性表 顺序表的实现

#include<stdio.h>
#include<stdlib.h>
//----------线性表的动态分配顺序存储结构----------
#define LIST_INIT_SIZE 100 //线性表存储空间的初始化分配量
#define LISTINCREMENT 10 //线性表存储空间的分配增量
#define OVERFLOW -2
typedef struct{
    int *elem; // 存储空间基址
    int length; // 当前长度
    int listsize; // 当前分配的存储空间容量(以sizeof(ElemType)为单位)
}SqList;
int InitList_Sq(SqList &L)
{
    // 构造一个空的线性表L
    L.elem = (int *)malloc(LIST_INIT_SIZE*sizeof(int));
    if(! L.elem) exit(OVERFLOW);      // 存储空间分配失败
    L.length = 0;               // 空表长度为0
    L.listsize = LIST_INIT_SIZE;// 初始存储容量
    return 1;
}// InitList_Sq
void ScanfList_Sq(SqList &L, int n)
{
    //读入i个顺序表
    int i=0;
    for(;i<n;i++){
        scanf("%d",&L.elem[i]);
        L.length++;
    }
}
void PrintfList_Sq(SqList &L)
{
    //输出当前顺序表
    int i=0;
    for(;i<L.length;i++){
        printf("%d\n", L.elem[i]);
    }

}
int ListInsert_Sq(SqList &L, int i, int e)
{
    //在顺序线性表L中第i个位置之前插入新的元素e
    //i的合法值为1<=i<=ListLength_Sq(L)+1
    if(i<1 || i>L.length+1) return 0;
    if(L.length >= L.listsize){         //当前存储空间已满，增加分配
        int *newbase = (int *)realloc(L.elem, (L.listsize + LISTINCREMENT) * (sizeof(int)));
        if(!newbase) return 0;  //存储分配失败
        L.elem = newbase;       //新基址
        L.listsize += LISTINCREMENT; //增加存储容量
    }
    int *q = &L.elem[i-1];
    int *p = &(L.elem[L.length - 1]);
    for(; p >= q; --p) *(p+1) = *p;
                                //插入位置及之后的元素右移
    *q = e; //插入e
    ++L.length; //表长增加1
    return 1;
}//ListInsert_Sq
int ListDelete_Sq(SqList &L, int i, int &e)
{
    //在顺序线性表L中删除第i个元素，并用e返回其值
    //i的合法值为1<=i<=ListLength_Sq(L);
    if((i<1) || (i>L.length)) return 0;
    int *p = &(L.elem[i-1]);
    e = *p;
    int *q = L.elem + L.length - 1;
    for(++p; p<=q; ++p) *(p-1)=*p;
    --L.length;
    return 1;
}
int cmp(int a,int b)
{
    return a>=b;
}
int LocateElem_Sq(SqList L, int e, int(*compare)(int,int) )
{
    //在顺序线性表L中查找第一个值与e满足compare的元素的位序
    //若找到，则返回其在L中的位序，否则返回0
    int i=1;    //i的初值为第一个元素的位序
    int *p = L.elem;    //p的初值为第一个元素的存储位置
    while(i <= L.length && !(* compare)(*p++, e)) ++i;
    printf("i = %d\n",i);
    if(i <= L.length) return i;
    else return 0;
}//LocateElem_Sq
void MergeList_Sq(SqList La,SqList Lb,SqList &Lc)
{
    //已知顺序线性表的La和Lb的元素按值非递减排列
    //归并La和Lb得到新的顺序线性表Lc，Lc的元素也按值非递减排列
    int *pa = La.elem, *pb = Lb.elem;
    Lc.listsize = Lc.length = La.length + Lb.length;
    int *pc = Lc.elem = (int *)malloc(Lc.listsize*sizeof(int));
    if(!Lc.elem) exit(OVERFLOW);    //存储分配失败
    int *pa_last = La.elem + La.length - 1;
    int *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 ++;
}//MergeList_Sq
int main()
{
    SqList L;
    int n;
    InitList_Sq(L);
    printf("请输入要读入顺序表L的个数:\n");
    scanf("%d",&n);
    ScanfList_Sq(L, n);
    PrintfList_Sq(L);
    ListInsert_Sq(L,6,4);
    PrintfList_Sq(L);
    int e;
    ListDelete_Sq(L,6,e);
    PrintfList_Sq(L);
    printf("被删除e是%d\n",e);
    int i = LocateElem_Sq(L,5,cmp);
    printf("5所在顺序表的位置是%d\n",i);
    SqList Lb;
    InitList_Sq(Lb);
    printf("请输入要读入顺序表L的个数:\n");
    scanf("%d",&n);
    ScanfList_Sq(Lb, n);
    PrintfList_Sq(Lb);
    SqList Lc;
    InitList_Sq(Lc);
    MergeList_Sq(L,Lb,Lc);
    PrintfList_Sq(Lc);
    return 0;
}