#include<iostream>
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXSIZE 100
using namespace std;typedef int Status;typedef struct
{int *elem;int length;
} SqList;
//构建空线性表
Status InistList(SqList &L)
{L.elem=new int [MAXSIZE];if(!L.elem)exit (OVERFLOW);L.length=0;return OK;
}
//输入
Status  CreatList(SqList &L,int n)
{for(int i=0; i<n; i++){cin>>L.elem[i];}L.length=n;return OK;
}
//取值
Status   iGetNumber(SqList &L,int i,int &e)
{if(i<1||i>L.length){return ERROR;}e=L.elem[i-1];return OK;
}
//查找
int  eLocateList(SqList &L,int e)
{for(int i=0; i<L.length; i++){if(L.elem[i]==e){return i+1;}}return 0;
}//插入
Status   eInsertList(SqList &L,int i,int e)
{if(i<1||i>L.length+1){return ERROR;}if(L.length==MAXSIZE){return ERROR;}for(int j=L.length-1; j>=i-1; j--){L.elem[j+1]=L.elem[j];}L.elem[i-1]=e;++L.length;return OK;
}
//删除
Status  aDeleteList(SqList &L,int i)
{if(L.length==0){return ERROR;}if((i<1)||(i>L.length)){return ERROR;}for(int j=i; j<=L.length-1; j++){L.elem[j-1]=L.elem[j];}--L.length;return OK;
}
//输出
void DisplayList(SqList &L)
{for(int i=0; i<L.length; i++){cout<<L.elem[i]<<" ";}
}
//欢迎
void WelcomeMenu()
{cout<<"1.初始化\n";cout<<"2.输入\n";cout<<"3.取值\n";cout<<"4.查找\n";cout<<"5.插入\n";cout<<"6.删除\n";cout<<"7.输出\n";cout<<"0.退出\n";cout<<endl;
}
int main()
{SqList L;WelcomeMenu();bool a=true;while(a){int N;cout<<endl<<"请选择：";cin>>N;switch(N){case 1:{if(InistList(L)){cout<<"成功初始化线性表";}else{cout<<"初始化线性表失败";}break;}case 2:{int n;cout<<"请输入元素个数：";cin>>n;cout<<"请输入"<<n<<"个元素：";CreatList(L,n);cout<<"输入完成";break;}case 3:{int i,e;cout<<"请输入一个位置用来取值：";cin>>i;if(iGetNumber(L,i,e)){cout<<"取值成功，值为：";cout<<e;}break;}case 4:{int e;cout<<"请输入所要查找的元素：";cin>>e;cout<<"查找成功，位置为："<<eLocateList(L,e);break;}case 5:{int i,e;cout<<"请输入插入位置：";cin>>i;cout<<"请输入插入元素：";cin>>e;eInsertList(L,i,e);cout<<"插入成功！";break;}case 6:{int a;cout<<"请输入所要删除的元素：";cin>>a;aDeleteList(L,a);cout<<"删除成功";break;}case 7:{cout<<"当前线性表为：";DisplayList(L);break;}case 0:{a=false;break;}}}return 0;
}