void main()
{
int i;
ElemType e;
struct node *L;
struct node *L1,*L2;
ElemType a[5]={'a','b','c','d','e'},b[5]={'f','g','h','i','j'};
InitList(L); //初始化
InsElem(L,'a',1);
InsElem(L,'c',2);
InsElem(L,'a',3);
InsElem(L,'e',4);
InsElem(L,'d',5);
InsElem(L,'b',6);
printf("线性表L：");DispList(L);
printf("长度：%d\n",GetLength(L));
i=3;GetElem(L,i,e);
printf("第%d个元素：%c\n",i,e);
e='a';
printf("元素%c是第%d个元素\n",e,Locate(L,e));
i=4;printf("删除第%d个元素\n",i);
DelElem(L,i);
printf("线性表：");DispList(L); //
CreateListF(L1,a,5);
printf("线性表L1：");
DispList(L1);
CreateListR(L2,b,5);
printf("线性表L2：");
DispList(L2);
}
int main(void)
{
ElemType site[11] = { 'a', 'n', 'o', 't', 'h', 'e', 'r', 'h', 'o', 'm', 'e' };
LinkList *Link, *LinkR;
ElemType e;
CreateListF(Link, site, 11);
CreateListR(LinkR, site, 11);
DispList(Link);
DispList(LinkR);
DestroyList(LinkR);
if (ListEmpty(Link))
{
printf("List is empty\n");
}
else
{
printf("List isn't empty\n");
}
printf("ListLength: %d\n", ListLength(Link));
GetElem(Link, ListLength(Link), e);
ListInsert(Link, 2, e);
DispList(Link);
ListDelete(Link, 3, e);
DispList(Link);
printf("The location of 'o' is %d\n", LocateElem(Link, 'o'));
DestroyList(Link);
return 0;
}