#include<stdio.h> //顺序表
#include<stdlib.h>
#include<string.h>
typedef int Elemtype;
typedef struct
{
Elemtype *data;
int length;
}SeqList;
//建表
void CreateSeqList(SeqList &L)
{
L.data=(Elemtype*)malloc(sizeof(Elemtype)*201);
L.length=0;
}
//初始化
void InitSeqList(SeqList &L)
{
scanf("%d",&L.length);
for(int i=0;i<L.length;i++)
scanf("%d",&L.data[i]);
}
//插入
void InsertSeqList(SeqList &L,int pos ,int x)
{
int i;
if(pos<0||pos>L.length)
return;
if(L.length==200)
return;
for(i=L.length-1;i>=pos;i--)
{
L.data[i+1]=L.data[i];
}
L.data[pos]=x;
L.length++;
}
//删除
void DeleteSeqList(SeqList &L,int pos)
{
if(pos<0||pos>=L.length)
return ;
if(L.length==0)
return ;
int i;
for(i=pos;i<L.length-1;i++)
L.data[i]=L.data[i+1];
L.length--;
}
//索引
void GetElemInSeqList(SeqList &L,int pos,int &x)
{
if(pos<0||pos>=L.length)
return ;
x=L.data[pos];
}
//查找
int FindInSeqList(SeqList &L, int x)
{
int i;
for(i=0;i<L.length;i++)
{
if(L.data[i]==x)
return i;
}
return -1;
}
//逆置
void ReverseSeqList(SeqList &L)
{
int x,i;
for(i=0;i<L.length/2;i++)
{
x=L.data[i];
L.data[i]=L.data[L.length-i-1];
L.data[L.length-i-1]=x;
}
}
//打印
void PrintSeqList(SeqList &L)
{
int i;
for(i=0;i<L.length;i++)
{
if(i)
printf(" ");
printf("%d", L.data[i]);
}
printf("\n");
}
//销毁
void DestroySeqList(SeqList &L)
{
free(L.data);
}
int main()
{
SeqList L;
CreateSeqList(L);//建表
char cmd[20];
int pos;
Elemtype x;
while(scanf("%s", cmd)!=EOF)
{
if(strcmp(cmd, "Init")==0)//初始化
InitSeqList(L);
else if(strcmp(cmd, "Print")==0)//打印表
PrintSeqList(L);
else if(strcmp(cmd, "Insert")==0)//位置前插入元素
{
scanf("%d%d", &pos, &x);
InsertSeqList(L, pos, x);
}
else if(strcmp(cmd, "Delete")==0)//删除
{
scanf("%d", &pos);
DeleteSeqList(L, pos);
}
else if(strcmp(cmd, "GetElem")==0)//索引
{
scanf("%d", &pos);
GetElemInSeqList(L, pos, x);
printf("%d\n", x);
}
else if(strcmp(cmd, "FindElem")==0)//查找
{
scanf("%d", &x);
pos = FindInSeqList(L, x);
if(pos == -1)
printf("Not found\n");
else
printf("%d\n", pos);
}
else if(strcmp(cmd, "Reverse")==0)//逆置
{
ReverseSeqList(L);
}
else
break;
}
DestroySeqList(L);//销毁
return 0;
}