1.这是全代码,有顺序表的定义,内存动态分配,取值,输出,合并,有的被注释掉了,
2#include <stdio.h>
#include <stdlib.h>
#define maxsize 100
#define OK 1
#define ERROR 0
#define OVERFLOW -2;
typedef int Status;
typedef struct { //定义顺序表
int num[maxsize];
}Number;
typedef struct{
Number *elem;
int length;
}SqList;
Status InitList(SqList &l)//初始化,分配空间
{
l.elem= (Number *)malloc(maxsize*(sizeof(Number)));
if(!l.elem)
return ERROR;
l.length=0;
return OK;
}