数据结构链表的顺序存储程序

printf("\n");
printf("Please Input Data:");
scanf("%d",&data);
Insert(SList,i,data);
len=Length(SList);
PrintList(SList,len);
break;
}
for(j=L->length-1;j>=i-1;j--)
{
L->data[j+1]=L->data[j];
}
L->data[i]=x;
L->length++;
}*/
DataType Delete(SeqList *L,int i)
{
int j;
{
L=(SeqList*)malloc(sizeof(SeqList));
L->length=-1;
return L;
}
void CreateList(SeqList *L,int n)
{
int i;
for(i=0;i<n;i++)
scanf("%d",&L->data[i]);
}
if(L->length==MAX-1)
{
printf("表满");
return(-1);
}
for(j=L->length-1;j>=i-1;j--)
{
L->data[j+1]=L->data[j];
}
L->data[i-1]=x;
L->length++;
#include<malloc.h>
#include<stdio.h>
#define MAX 100
typedef int DataType;
typedef struct
{
DataType data[MAX];
int length;
}SeqList;
SeqList *InitList(SeqList *L)
{
int i;
for(i=0;i<L->length;i++)
visit(L->data[i];
}*/
void PrintList(SeqList *L,int n)
{
int i;
for(i=0;i<n;i++)
printf("%d ",L->data[i]);
scanf("%d",&data);
loc=Locate(SList,data);
printf("\n");
break;
}
case 6:{printf("Please input position of Data:");
scanf("%d",&i);
printf("=======================================\n");
printf(" List Initializing-----------1\n");
printf(" List Creating---------------2\n");
printf(" List Inserting--------------6\n");
printf(" List deleting---------------7\n");
printf(" Quit--------------------------0\n");
}
int Locate(SeqList*L,DataType x)
{
int i=0;
while(i<=L->length-1 && L->data[i-1]!=x)
{
i++;
}
if(i>L->length-1)
{
printf("没有找到");
return-1;
scanf("%d",&i);
data=Get(SList,i);
printf("\n");
printf("The data is :%d\n",data);
break;
}
case 5:{printf("Please Input Data:");
break;
}
case 7:{printf("Please input position of Data Deleting:");
scanf("%d",&i);
Delete(SList,i);
len=Length(SList);
printf("\n");
}
SeqList *SList,*L;
DataType data;
void main()
{
int selection,len,n,i,loc,flag=1;
n=5;
L=(SeqList*)malloc(sizeof(SeqList));
printf(" sequential List\n");
for(j=i;j<=L->length;j++)
L->data[j-1]=L->data[j];
L->length--;
printf("删除了第%d个元素，其值为%d",i,temp);
return(1);
}
/*void TraverseList(SeqList *L)
return(1);
}
/*int Insert2(SeqList *L,DataType x)
{
if(L->length==MAX-1)
{
printf("表满");
return(-1);
}
for(i=0;i<L->length;i++)
{
if(x<L->data[i])
L->length=n;
}
int Length(SeqList *L)
{
return L->length;
}
DataType Get(SeqList *L,int i)
{
if(i<0||i>(L->length)-1)
return(-1);
else
return L->data[i-1];
switch(selection){
case 0:{flag=0;break;}
case 1:{SList=InitList(L);break;}
case 2:{CreateList(SList,n);
len=Length(SList);
PrintList(SList,len);
printf("\n");
PrintList(SList,len);
}
}
}
}
}
else
{
printf("查找成功，位于第%d个位置",i);
return i;
}
}
int Insert(SeqList*L,int i,DataType x)
{ int j;
if(i<1||i>L->length)
{
printf("位置错");
return(0);
DataType temp;
if(L->length==-1)
{
priቤተ መጻሕፍቲ ባይዱtf("线性表为空，无法删除");
return(0);
}
if(i<1||i>L->length+1)
{
printf("不存在第%d个元素",i);
return(0);
}
temp=L->data[i-1];
break;}
case 3:{len=Length(SList);
printf("线性表的长度是:%d\n",len);
break;
}
case 4:{printf("please input position of Data:");
printf("=======================================\n");
printf("\n");
while(flag){
printf("Please choise and enter the number:");
scanf("%d",&selection);