#include<iostream>
using namespace std;
typedef int status;
typedef int ElemType;
//定义顺序表结构
typedef struct{
int length;
ElemType *elem;
}SqList;
//初始化
status Initlist_Sq(SqList &L)
{
L.elem=new ElemType[10];
if(L.elem==NULL)
{
return 0;
}
L.length=0;
return 1;
}
//建立顺序表
void CreatList_Sq(SqList &L)
{
ElemType n;
cout<<"请输入你要建立顺序表中元素个数"<<endl;
cin>>n;
cout<<"请输入你要你想要建立顺序表中的值"<<endl;
for(int i=0;i<n;i++)
{
cin>>L.elem[i];
L.length++;
}
cout<<"建立成功!"<<endl;
}
//遍历当前顺序表
void ShowList_Sq(SqList L)
{
cout<<"当前顺序表长度为"<<L.length<<endl;
cout<<"当前顺序表中元素为:";
for(int i=0;i<L.length;i++)
{
cout<<L.elem[i]<<" ";
}
}
//插入元素
status InsertList_Sq(SqList &L)
{
int n;
ElemType e;
cout<<"请输入你要插入值的位置"<<endl;
cin>>n;
if(n<0 || n>L.length+1)
{
return 0;
}
else
{
cout<<"请输入你要插入的值"<<endl;
cin>>e;
for(int i=L.length;i>n-1;i--)
{
L.elem[i]=L.elem[i-1];
}
L.elem[n-1]=e;
L.length++;
return 1;
}
}
//删除元素
status Deletelist_Sq(SqList &L)
{
int n;
cout<<"请输入你要删除元素位置"<<endl;
cin>>n;
if(n<=0 || n>L.length)
{
return 0;
}
else
{
for(int i=n;i<=L.length-1;i++)//删除第n个(下标为n-1),从下标为n开始覆盖前
{ //一个直到最后一个覆盖倒数第二个,完成删除
L.elem[i-1]=L.elem[i];
}
L.length--;
}
}
//查找元素
int Search_Sq(SqList L,ElemType n)
{
int count=1;
for(int i=0;i<L.length;i++)
{
if(L.elem[i]==n)
{
return count;
}
else
{
count++;
}
}
return 0;
}
int main()
{
SqList L;
ElemType n;
//初始化
if(Initlist_Sq(L))
{
cout<<"初始化成功!"<<endl;
}
else
{
cout<<"初始化失败!"<<endl;
}
//建立顺序表
CreatList_Sq(L);
//遍历顺序表
ShowList_Sq(L);
cout<<endl;
//插入元素
if(InsertList_Sq(L))
{
cout<<"插入成功"<<endl;
}
else
{
cout<<"插入失败"<<endl;
}
//遍历顺序表
ShowList_Sq(L);
cout<<endl;
//删除元素
if(Deletelist_Sq(L))
{
cout<<"删除成功"<<endl;
}
else
{
cout<<"删除失败"<<endl;
}
//遍历顺序表
ShowList_Sq(L);
cout<<endl;
cout<<"请输入你要查找的值"<<endl;
cin>>n;
if(Search_Sq(L,n))
{
cout<<"查找成功,该值在该顺序表中位置是"<<Search_Sq(L,n)<<endl;
}
else
{
cout<<"该值不在该顺序表中"<<endl;
}
return 0;
}
代码运行结果:
没有做成那种switch的,这次写是为了增强熟练度,希望可以帮到你们,欢迎指正