实验1

头文件
#ifndef SeqList_H
#define SeqList_H
const int MaxSize=10;
class SeqList
{
public:
SeqList(){length=0;}
SeqList(int a[],int n);
~SeqList(){}
int Locate(int x);
void Insert(int i,int x);
int Delete(int i);
void PrintList();
private:
int data[MaxSize];
int length;
};

#endif

源程序文件

#include"SeqList.h"
SeqList::SeqList(int a[],int n)
{
int i;
if(n>MaxSize) throw"程序错误";
for (i=0;i<n;i++)
data[i]=a[i];
length=n;
}


int SeqList::Locate(int x)
{
int i;
for (i=0;i<length;i++)
if (data[i]==x)
return i+1;
return 0;
}

void SeqList::Insert(int i,int x)
{
int j;
if(length>=MaxSize)
throw"上溢";
if(i<1||i>length+1)
throw"位置非法";
for(j=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"位置非法";
int x=data[i-1];
for(int j=i;j<length;j++)
data[j-1]=data[j];
length--;
return x;
}
void SeqList::PrintList()
{
for(int i=0;i<length;i++)
cout<<data[i]<<"";
cout<<endl;

}


源程序文件
#include<iostream.h>
#include"SeqList.h"


void main()
{int r[4]={0,2,3,4};
SeqList L(r,4);
cout<<"执行插入操作前数据为:"<<endl;
L.PrintList();
try
{L.Insert(1,1);
}
catch(char *s)
{
cout<<s<<endl;
}
cout<<"执行插入操作后数据为:"<<endl;
L.PrintList();
cout<<数字为1的元素位置为:";
cout<<L.Locate(1)<<endl;
cout<<"执行删除操作前数据为:"<<endl;
L.PrintList();
try
{L.Delete(1);
}


catch(char *s)
{
cout<<s<<endl;
}
cout<<"执行删除操作后数据为:"<<endl;
L.PrintList();
}