实验一：线性表操作 数据结构系统上实验代码.doc

#include<stdio.h>
#include<malloc.h>
#defineOK1
#defineERROR0
#defineLIST_INIT_SIZE100
#defineLISTINCREMENT10
#defineElemTypeint

typedefstruct
{
int*elem,length,listsize;
}SqList;

intInitList_Sq(SqList&L)
{
L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));
L.length=0;
L.listsize=LIST_INIT_SIZE;
returnOK;
}

intLoad_Sq(SqList&L)
{
inti;
if(L.length==0)
printf("TheListisempty!");
else
{
printf("TheListis:");
for(i=0;i<L.length;i++)
printf("%d",L.elem[i]);
}
printf("\n");
returnOK;
}

intListInsert_Sq(SqList&L,inti,inte)
{
if(i<1||i>L.length+1)
returnERROR;
ElemType*newbase,*q,*p;
if(L.length>=L.listsize)
{
newbase=(ElemType*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1]);p>=q;--p)
*(p+1)=*p;
*q=e;
++L.length;
returnOK;
}

intListDelete_Sq(SqList&L,inti,int&e)
{
ElemType*q,*p;
if(i<1||i>L.length)
returnERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p<=q;p++)
*(p-1)=*p;
L.length--;
returnOK;
}

intmain()
{
SqListT;
inta,i;
ElemTypee,x;
if(InitList_Sq(T))
{
printf("ASequenceListHasCreated.\n");
}
while(1)
{
printf("1:Insertelement\n2:Deleteelement\n3:Loadallelements\n0:Exit\nPleasechoose:\n");
scanf("%d",&a);
switch(a)
{
case1:scanf("%d%d",&i,&x);
if(!ListInsert_Sq(T,i,x))
printf("InsertError!\n");
else
printf("TheElement%disSuccessfullyInserted!\n",x);
break;
case2:scanf("%d",&i);
if(!ListDelete_Sq(T,i,e))
printf("DeleteError!\n");
else
printf("TheElement%disSuccessfullyDeleted!\n",e);
break;
case3:Load_Sq(T);
break;
case0:return1;
}
}
}

222222222222222222222222222222222222222222222222222222222222222222222222222222
#include<stdio.h>
#include<malloc.h>
#defineOK1
#defineERROR0
#defineLIST_INIT_SIZE100
#defineLISTINCREMENT10
#defineElemTypeint

typedefstruct
{
int*elem,length,listsize;
}SqList;

intInitList_Sq(SqList&L)
{
L.e