头文件:SqList.h
#include<cstdlib>
#include<iostream>
using namespace std;
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
//#define OVERFLOW -2
typedef int ElemType;
typedef int Status;
typedef struct
{
ElemType *elem;
int length;
int listsize;
}SqList;
#include<iostream>
using namespace std;
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
//#define OVERFLOW -2
typedef int ElemType;
typedef int Status;
typedef struct
{
ElemType *elem;
int length;
int listsize;
}SqList;
//构造一个空的线性表L
Status InitList_Sq(SqList& L)
{
L.elem = (ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
Status InitList_Sq(SqList& L)
{
L.elem = (ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
//销毁线性表L
Status DestroyList_Sq(SqList& L)
{
free(L.elem);
L.elem = NULL;
return OK;
}
Status DestroyList_Sq(SqList& L)
{
free(L.elem);
L.elem = NULL;
return OK;
}
//将线性表L置为空表
Status ClearList_Sq(SqList& L)
{
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
Status ClearList_Sq(SqList& L)
{
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
//判断线性表L是否为空
Status ListEmpty_Sq(SqList L)
{
if (0 == L.length)
return TRUE;
else
return FALSE;
}
Status ListEmpty_Sq(SqList L)
{
if (0 == L.length)
return TRUE;
else
return FALSE;
}