顺序链表的初始化，插入，删除，查询

顺序链表的初始化，插入，删除，查询

#include<iostream>
#include<cstdio>
#include<malloc.h>

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OVERFLOW -2
#define ERROR 0
#define OK 1
typedef struct{
    int *elem;
    int length;//线性表的长度
    int listsize;//当前分配的存储容量
}SqList;

int InitList_Sq(SqList &L){
    L.elem=(int *)malloc(LIST_INIT_SIZE*sizeof(int));
    if(!L.elem)exit(OVERFLOW);
    for(int i=0;i<10;i++){
        L.elem[i]=i+1;
    }
    L.length=10;
    L.listsize=LIST_INIT_SIZE;
    return OK;
}

int ListInsert_Sq(SqList &L,int i,int e){
    //向第i个位置插入元素e
    if(i<1||i>L.length+1)return ERROR;
    if(L.length>=L.listsize){
        int *newbase;
        newbase=(int *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(int));
        if(!newbase)exit(OVERFLOW);
        L.elem=newbase;
        L.listsize+=LISTINCREMENT;
    }
    int *p,*q;
    q=L.elem+i-1;
    p=L.elem+L.length-1;
    for(;q<=p;p--)*(p+1)=*p;
    *q=e;
    L.length++;
}

int ListDelete_Sq(SqList &L,int i,int &e){
    //删除第i个元素并用e返回
    if(i<1||i>L.length)return ERROR;
    int *q,*p;
    q=L.elem+i-1;
    p=L.elem+L.length-1;
    e=*q;
    for(++q;q<=p;++q)*(q-1)=*q;
    L.length--;
}

int Position(SqList &L,int e){
    int *q,*p;
    q=L.elem;
    p=L.elem+L.length-1;
    for(int i=0;i<L.length;i++){
        if(*q==e)return i+1;
        ++q;
    }
}
int main(){
    SqList T;
    InitList_Sq(T);
    for(int i=0;i<T.length;i++){
        printf("%d ",T.elem[i]);
    }
    printf("\n");
    ListInsert_Sq(T,3,8);//随便插入到第三个位置值为8的元素
    for(int i=0;i<T.length;i++){
        printf("%d ",T.elem[i]);
    }
    printf("\n");
    int e;
    ListDelete_Sq(T,3,e);
    printf("删掉的元素为%d\n",e);
    for(int i=0;i<T.length;i++){
        printf("%d ",T.elem[i]);
    }
    int m=Position(T,5);
    printf("\n值为5的元素是第%d个\n",m);
}

顺序表的合并（两个有序表）

#include<iostream>
#include<cstdio>
#include<malloc.h>

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OVERFLOW -2
typedef struct{
    int *elem;
    int length;
    int listsize;
}SqList;

int InitList_Sq(SqList &L){
    L.elem=(int *)malloc(LIST_INIT_SIZE*sizeof(int));
    if(!L.elem)exit(OVERFLOW);
    int a;
    printf("请输入线性表的长度\n",a);
    scanf("%d",&a);
    L.length=a;
    printf("请输入线性表的元素\n");
    for(int i=0;i<a;i++){
        scanf("%d",&L.elem[i]);
    }
    L.listsize= LIST_INIT_SIZE;
}
void MergeList_Sq(SqList La,SqList Lb,SqList &Lc){
    //La和Lb是两个递增的线性表
    int *pa,*pb,*pa_last,*pb_last;
    pa=La.elem;
    pb=Lb.elem;
    pa_last=La.elem+La.length-1;
    pb_last=Lb.elem+Lb.length-1;

    Lc.length=La.length+Lb.length;
    Lc.listsize=La.length+Lb.length;
    Lc.elem=(int *)malloc(Lc.listsize*sizeof(int));
    if(!Lc.elem)exit(OVERFLOW);

    int *pc;
    pc=Lc.elem;
    while(pa<=pa_last&&pb<=pb_last){
        if(*pa<=*pb){*pc++=*pa++;}
        else {*pc++=*pb++;}
    }
    //注意此处是<=而非<(因为，上面的while循环到其中一个表的最后一个元素时会加一这时px>px_last)
    while(pa<=pa_last){*pc++=*pa++;}
    while(pb<=pb_last){*pc++=*pb++;}
}

int main(){
    SqList A,B,C;
    InitList_Sq(A);
    InitList_Sq(B);
    MergeList_Sq(A,B,C);
    printf("合并后的表为：\n");
    for(int i=0;i<C.length;i++){
        printf("%d ",C.elem[i]);
    }
}