bv汽车钥匙扣:实现顺序表的各种基本运算的算法问题

我写的是:
#include<stdio.h>
#include<malloc.h>
#define MaxSize 50
typedef char ElemType;
typedef struct
{ ElemType elem[MaxSize];
int length;
}SqList;
void InitList(SqList *&L)
{
L=(SqList *)malloc(sizeof(SqList));
L->length=0;
}
void DestroyList(SqList*L)
{
free(L);
}
int ListEmpty(SqList *L)
{
return(L->length==0);
}
int ListLength(SqList *L)
{
return(L->length);
}
void DispList(SqList *L)
{
int i;
if(ListEmpty(L)) return;
for(i=0;i<L->length;i++)
printf("%c",L->elem[i]);
printf("\n");
}
int GetElem(SqList *L,int i,ElemType &e)
{
if(i<1||i>L->length)
return 0;
e=L->elem[i-1];
return 1;
}
int LocateElem(SqList *L,ElemType e)
{
int i=0;
while(i<L->length&&L->elem[i]!=e)i++;
if(i>=L->length)
return 0;
else
return i+1;
}
int ListInsert(SqList *&L,int i,ElemType e)
{
int j;
if(i<1||i>L->length+1)
return 0;
i--;
for(j=L->length;j>i;j--)
L->elem[j]=L->elem[j-1];
L->elem[i]=e;
L->length++;
return 1;
}
int ListDelete(SqList *&L,int i,ElemType &e)
{
int j;
if(i<1||i>L->length)
return 0;
i--;
e=L->elem[i];
for(j=i;j<L->length-1;j++)
L->elem[j]=L->elem[j+1];
L->length--;
return 1;
}
主函数是:
#include<stdio.h>
#include<malloc.h>
#define MaxSize 50
typedef char ElemType;
typedef struct
{ElemType elem[MaxSize];
int length;
}SqList;
extern void InitList(SqList*&L);
extern void DestroyList(SqList*&L);
extern int ListEmpty(SqList*L);
extern int ListLength(SqList*L);
extern void DispList(SqList*L);
extern int GetElem(SqList*L,int i,ElemType &e);
extern int LocateElem(SqList *L,ElemType e);
extern int ListInsert(SqList*&L,int i,ElemType e);
extern int ListDelete(SqList*&L,int i,ElemType &e);
void main()
{
SqList *L;
ElemType e;
printf("(1)初始化顺序表L\n");
InitList(L);
printf("(2)依次采用尾插法插入a,b,c,d,e元素\n");
ListInsert(L,1,'a');
ListInsert(L,2,'b');
ListInsert(L,3,'c');
ListInsert(L,4,'d');
ListInsert(L,5,'e');
printf("(3) 输出顺序表L：");
DispList(L);
printf("(4)顺序表L长度=%d\n",ListLength(L));
printf("(5)顺序表L为%s\n",(ListEmpty(L)?"空":"非空"));
GetElem(L,3,e);
printf("(6)顺序表L的第3个元素=%c\n",e);
printf("(7)元素a的位置=%d\n",LocateElem(L,'a'));
printf("(8)在第4个元素位置上插如f元素\n");
ListInsert(L,4,'f');
printf("(9)输出顺序表L:");
DispList(L);
printf("(10)删除L的第3个元素\n");
ListDelete(L,3,e);
printf("(11)输出顺序表L:");
DispList(L);
printf("(12)释放顺序表L\n");
DestroyList(L);
}
最后怎么出现2个error:
xp2-1.obj : error LNK2001: unresolved external symbol "void __cdecl DestroyList(struct SqList * &)" (?DestroyList@@YAXAAPAUSqList@@@Z)
Debug/exp2-1.exe : fatal error LNK1120: 1 unresolved externals
Error executing link.exe.
请高手帮忙!
告诉我在哪里加点什么哦?谢了!