实验三 线性表综合实验
1）用顺序表来实现
const int MaxSize=100;
class SeqList
{
public:
SeqList(){length=0;}
SeqList(inta[],int n);
~SeqList(){}
voidInsert(int i,int x);
intDelete(int i);
intLocate(int x);
voidPrintList();
private:
intdata[MaxSize];
intlength;
};
#include<iostream>
using namespace std;
SeqList::SeqList(int a[],int n)
{
if(n>MaxSize)throw"参数非法";
for(inti=0;i<n;i++)
data[i]=a[i];
length=n;
}
void SeqList::Insert(int i,int x)
{
if(length>=MaxSize)throw"上溢";
if(i<1||i>length+1)throw"位置非法";
for(intj=length;j>=i;j--)
data[j]=data[j-1];
data[i-1]=x;
length++;
}
int SeqList::Delete(int i)
{
if(length==0)throw"下溢";
if(i<1||i>length)throw"位置非法";
intx=data[i-1];
for(intj=i;i<length;j++)
data[j-1]=data[j];
length--;
returnx;
}
int SeqList::Locate(int x)
{
for(inti=0;i<length;i++)
if(data[i]==x)return i+1;
return0;
}
void SeqList::PrintList()
{
for(inti=0;i<length;i++)
cout<<data[i]<<"";
cout<<endl<<endl;
}
void main()
{
intr[8]={64,87,92,76,71,65,89,83};
SeqListL(r,8);
cout<<"学生数据结构成绩如下:";
L.PrintList();
try
{
L.Insert(2,69);
}
catch(char*s)
{
cout<<s<<endl<<endl;
}
cout<<"在位置1`2之间插入成绩为69的同学,操作后数据为:";
L.PrintList();
cout<<"成绩为76的同学的位置为:";
cout<<L.Locate(76)<<endl<<endl;
cout<<"删除学生成绩信息,删除前数据为:";
L.PrintList();
try{
L.Delete(1);
}
catch(char*s)
{
cout<<s<<endl<<endl;
}
cout<<"删除位于第一个位置的同学成绩:";
L.PrintList();
}
