信管117128许盛迪数据结构实验一

#include<iostream>

using namespace std;

#ifndef SeqList_H

#define SeqList_H

const int MaxSize=10;

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;

};

 

SeqList::SeqList(int a[],int n)

{

if(n>MaxSize)throw"参数非法";

for(int i=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;j<length;j++)

              data[j-1]=data[j];

       length--;

       returnx;

}

 

int SeqList::Locate(int x)

{

       for(inti=0;i<length;i++)

              if(data[i]==x)returni+1;

              return0;

}

 

void SeqList::PrintList()

{

       for(inti=0;i<length;i++)

              cout<<data[i]<<"";

       cout<<endl;

}

 

void main()

{

       intr[5]={1,2,3,4,5};

       SeqListL(r,5);

       cout<<"执行插入操作前数据为："<<endl;

       L.PrintList();

       try

       {

              L.Insert(2,3);

       }

       catch(char*s)

       {

              cout<<s<<endl;

       }

       cout<<"执行插入操作后数据为："<<endl;

       L.PrintList();

       cout<<"值为3的元素位置为:";

       cout<<L.Locate(3)<<endl;

       cout<<"执行删除第一个元素操作，删除前数据为："<<endl;

       L.PrintList();

       try

       {

              L.Delete(1);

       }

       catch(char*s)

       {

              cout<<s<<endl;

       }

       cout<<"删除后数据为"<<endl;

       L.PrintList();

}