8577 合并顺序表

//8577 合并顺序表

#include<stdio.h>
#include<malloc.h>
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int

typedef int Status;
typedef struct			//顺序表结构定义 
{
    int *elem;
    int length;
    int listsize;
}SqList;

Status InitList_Sq(SqList &L)
{  // 算法2.3
  // 构造一个空的线性表L。
  L.elem = (ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
  if (!L.elem) return OK;        // 存储分配失败
  L.length = 0;                  // 空表长度为0
  L.listsize = LIST_INIT_SIZE;   // 初始存储容量
  return OK;
} // InitList_Sq

Status ListInsert_Sq(SqList &L,int i,ElemType)
{
	ElemType *p;
	
}


Status F(SqList &L)
{
	int n,i=1;
	scanf("%d",&n);
	while(i<n)
	{
		int e;
		scanf("%d",&e);
		ListInsert_Sq(L,i,e);
		i++;
	}
}



int main()
{
	SqList a,b,c;
	int i;
	InitList_Sq(a);
	F(a);
	InitList_Sq(b);
	F(b);
	ListMerge_Sq(a,b,c);
	printf("List A:");
	for(i=0;i<=a.length-1;i++)
    {
        printf("%d ",a.elem[i]);
    }
    printf("\nList B:");
    for(i=0;i<=b.length-1;i++)
    {
        printf("%d ",b.elem[i]);
    }
    printf("\nList C:");
    for(i=0;i<=c.length-1;i++)
    {
        printf("%d ",c.elem[i]);
    }
    return 0;
}