#include<stdio.h>
#define MAXLEN 100
typedef int DataType;
typedef struct
{ DataType data[MAXLEN];
int Length;
} SeqList;
SeqList L;
void InitList( SeqList *L)
{
L->Length = 0;
}
void CreateList( SeqList *L,int n)
{
int i;
printf("请输入%d个整数:",n);
for(i = 0;i < n;i++)
scanf("%d",&L->data[i]);
L->Length = i;
}
int GetElem( SeqList *L, int i; DataType *x)
{
if(i<1 || i>L->Length)
return 0;
else{
*x = L->date[i-1];
return 1;
}
}
int Locate( SeqList *L, DataType x)
{
int i = 0;
while(i<L->Length && L->data[i] != x)
i++;
if(i >= L->Length)
teturn 0;
else
return i+1;
}
int InsElem( SeqList *L, int i, DataType x)
{
int j;
if (L->Length >= MAXLEN){
printf("顺序表已满!");
return -1;
}
if (i < 1 || i>L->Length+1) {
printf("插入位置出错!");
return 0;
}
if (i == L->Length+1){
L->data[i-1] = x;
L->Length++;
return l;
}
for (j = L->Length-1;j >= i-l;j--)
L->data[j+1] = L->data[j];
L->data[i-1] = x;
L->Length++;
return l;
}
int DelElem( SeqList *L, int i; DataType *x)
{
int j;
if(L->Length == 0){
printf("顺序表为空!");
return 0;
}
if(i<1 || i>L->Length;j++){
printf("不存在第i个元素");
return 0;
}
*x = L->data[i-1];
for(j = i;j<L->Length;j++)
L->data[j-1] = L->data[j];
L->Length--;
return 1;
}
void DispList( SeqList *L)
{
int i;
for(i = 0;i<->Length;i++)
printf("%5d",L->data[i]);
}
main(){
SeqList L;
DataType x;
int n,i,loc;
char ch1,ch2,a;
ch1 = 'y';
while(ch1 == 'y' || ch1 =='Y'){
scanf("%c",&ch2);
getchar();
switch(ch2){
case '1':
InitList(&L );
printf("请输入建立线性表的个数:");
scanf("*d",&n);
CreateList(&L,n);
printf("建立的线性表为:");
DispList(&L);
break;
}
}
}