信管117217潘泳麒数据结构实验3

#include<iostream>

using namespace std;

const int MaxSize=10;

class SeqList

{

public:

      SeqList(){length=0;}

      SeqList(int a[],int n);

      ~SeqList(){}

       intDelete(int i);

void Insert(int i,int x);

       intLocate(int x);

      void PrintList();

private:

      intdata[MaxSize];

       intlength;

};

 SeqList

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(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"位置非法";

      x=data[i-1];

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

             return 0;

}

 

void SeqList::PrintList()

{

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

             cout<<data[i]<<";

      cout<<endl;

}

 

void main()

{

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

      SeqList L(r,5);

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

       L.PrintList();

       try

       {

             L.Insert(2,3);

       }

      catch(char*s)

       {

             cout<<s<<endl;

       }

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

      *L.PrintList();

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

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

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

      *L.PrintList();

       try

       {

             L.Delete(2);

       }

      catch(char*s)

       {

             cout<<s<<endl;

       }

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

       L.PrintList();

}