实验一   合并顺序表

#include
#include "stdlib.h"
#include
#define ok 1
#define error 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define elemtype int

typedef struct
{
    int *elem;
    int length;

}SqList;

int InitList_sq(SqList &A,int n)    //给出一个参数 说出创建多少个元素
{
    A.elem=(elemtype *)malloc(n*sizeof(elemtype));
    if(!A.elem)
        return error;
    A.length=n;
    return ok;
}

int Load_Sq(SqList &L)
{ //遍历顺序表
    int i;
    if(L.length == 0)