头文件:
#include "stdio.h"
#include "malloc.h"
#define MaxSize 50
typedef int ElemType;
typedef struct
{
ElemType data[MaxSize];
int length;
}SqList;
void CreateList(SqList *&L,ElemType a[],int n);
bool ListEmpty(SqList *L);
void DispList(SqList *L);
int ListLength(SqList *L);
bool GetElem(SqList *L,int i,ElemType &e);
int LocateElem(SqList *L,ElemType e);
函数实现:
#include "a.h"
void CreateList(SqList *&L,ElemType a[],int n)
{
L=(SqList *)malloc(sizeof(SqList));
for(int i=0;i<n;i++)
L->data [i]=a[i];
L->length =n;
}
bool ListEmpty(SqList *L)
{
return (L->length ==0);
}
void DispList(SqList *L)
{
for(int i=0;i<L->length ;i++)
printf("%d ",L->data[i]);
printf("\n");
}
int ListLength(SqList *L)
{
return (L->length );
}
bool GetElem(SqList *L,int i,ElemType &e)
{
if(i<1||i>L->length )
return false;
e=L->data [i-1];
return true;
}
int LocateElem(SqList *L,ElemType e)
{
int i=0;
while (i<L->length&&L->data[i]!=e)
i++;
if(i>=L->length)
return 0;
else return (i+1);
}
主函数:
#include "a.h"
int main()
{
SqList *sq;
int loc;
ElemType p;
ElemType a[5]={5,6,7,8,9};
CreateList(sq,a,5);
if(ListEmpty==0)
return false;
else
{
DispList(sq);
ListLength(sq);
if(GetElem(sq, 3,p ))
printf("找到了第3个元素值为:%d\n", a);
else
printf("第3个元素超出范围!\n");
if(GetElem(sq, 7, p))
printf("找到了第7个元素值为:%d\n", a);
else
printf("第7个元素超出范围!\n");
if((loc=LocateElem(sq, 8))>0)
printf("找到了,值为8的元素是第 %d 个\n", loc);
else
printf("值为8的元素没有找到!\n");
if((loc=LocateElem(sq, 17))>0)
printf("找到了,值为17的元素是第 %d 个\n", loc);
else
printf("值为17的元素没有找到!\n");
}
return 0;
}
测试结果: