线性表顺序存储完成对线性表的初始化、创建、输入、输出、取值、查询、删除等操作。
初始化:
Status InitList(SqList &L)
{
L.elem=new ElemType[MAXSIZE];
if(!L.elem)
exit(OVERFLOW);
L.length=0;
return OK;
}
存放数据:
void Input(SqList &L, int n)
{
int i;
for(i=0;i<n;i++)
{
cin>>L.elem[i];
L.length++;
}
}
输出数据:
void Output(SqList L)
{
int i;
for(i=0;i<L.length;i++)
cout<<L.elem[i]<<" ";
}
取值:
Status GetElem(SqList L,int i,ElemType &e)
{
if(i<1||i>L.length)
return ERROR;
e=L.elem[i-1];
return OK;
}
查找:
int LocateElem(SqList L,int e)
{
int i;
for(i=0;i<L.length;i++)
if(L.elem[i]==e)
return i+1;
return 0;
}
插入:
Status ListInsert(SqList &L,int i,ElemType e)
{
int j;
if((i<1)||(i>L.length+1))
return ERROR;
if(L.length==MAXSIZE)
return ERROR;
for(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 ListDelete (SqList &L,int i)
{
int j;
if(i<1||(i>L.length+1))
return ERROR;
for(j=i;j<=L.length-1;j++)
L.elem[j-1]=L.elem[j];
--L.length;
return OK;
}
程序
#include <iostream>
#include <stdlib.h>
using namespace std;
#define MAXSIZE 20
#define OVERFLOW -2
#define ERROR 0
#define OK 1
typedef int Status;
typedef int ElemType;
typedef struct
{
ElemType *elem;
int length;
} SqList;
//初始化
Status InitList(SqList &L)
{
L.elem=new ElemType[MAXSIZE];
if(!L.elem)
exit(OVERFLOW);
L.length=0;
return OK;
}
//存放数据
void Input(SqList &L, int n)
{
int i;
for(i=0;i<n;i++)
{
cin>>L.elem[i];
L.length++;
}
}
//输出数据
void Output(SqList L)
{
int i;
for(i=0;i<L.length;i++)
cout<<L.elem[i]<<" ";
}
//取值
Status GetElem(SqList L,int i,ElemType &e)
{
if(i<1||i>L.length)
return ERROR;
e=L.elem[i-1];
return OK;
}
//查找
int LocateElem(SqList L,int e)
{
int i;
for(i=0;i<L.length;i++)
if(L.elem[i]==e)
return i+1;
return 0;
}
//插入
Status ListInsert(SqList &L,int i,ElemType e)
{
int j;
if((i<1)||(i>L.length+1))
return ERROR;
if(L.length==MAXSIZE)
return ERROR;
for(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 ListDelete (SqList &L,int i)
{
int j;
if(i<1||(i>L.length+1))
return ERROR;
for(j=i;j<=L.length-1;j++)
L.elem[j-1]=L.elem[j];
--L.length;
return OK;
}
int main()
{
SqList L;
int i=0,temp,a,b,c,choose;
ElemType e;
cout<<"1. 初始化\n";
cout<<"2. 输入\n";
cout<<"3. 输出\n";
cout<<"4. 取值\n";
cout<<"5. 查找\n";
cout<<"6. 插入\n";
cout<<"7. 删除\n";
choose = -1;
while(choose !=0){
cout<<"请选择: ";
cin>>choose;
switch(choose){
case 1:
if(InitList(L))
cout<<"成功建立顺序表.\n";
else
cout<<"顺序表建立失败.\n";
break;
case 2:
cout<<"请输入要输入的线性表的个数: ";
cin>>a;
Input(L,a);
cout<<"输入完毕."<<endl;
break;
case 3:
cout<<"读出顺序表:\n";
for(i=0;i<L.length;i++)
cout<<left<<L.elem[i]<<" ";
cout<<endl;
break;
case 4:
cout<<"请输入一个位置来取值: ";
cin>>i;
temp=GetElem(L,i,e);
if(temp!=0){
cout<<"查找成功\n";
cout<<"第"<<i<<"个数据的信息: ";
cout<<e<<"\n";
}
else
cout<<"查找失败!位置超出范围\n";
break;
case 5:
cout<<"输入一个值:";
cin>>b;
temp=LocateElem(L,b);
if(temp !=0){
cout<<"查找成功\n";
cout<<"第"<<temp<<"个元素。\n";
}
else
cout<<"查找失败,没有对应数字\n";
break;
case 6:
cout<<"请输入插入的位置和数值: ";
cin>>a>>e;
if(ListInsert(L,a,e))
cout<<"插入成功\n";
else
cout<<"插入失败\n";
break;
case 7:
cout<<"请输入要删除的位置:";
cin>>c;
if(ListDelete(L,c))
cout<<"删除成功\n";
else
cout<<"删除失败\n";
break;
}
}
return 0;
}