数据结构实验一 Liu Jie ying

# include<iostream>

using namespace std;

const int MaxSize=100;

template<class DataType>

class SeqList

{

public:

SeqList(){length=0;}

void CreateList(DataType a[],int n);

~SeqList(){}

int Length(){return length;}

DataType Get(int i);

int Locate(DataType x);

void Insert(int i,DataType x);

bool Delete(int i);

void PrintList();

private:

DataType data[MaxSize];

int length;

};

template<class DataType>

void SeqList<DataType>::CreateList(DataType a[],int n)

{

int i;

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

for(i=0;i<n;i++)

data[i]=a[i];

length=n;

}

template<class DataType>

DataType SeqList<DataType>::Get(int i)

{

if(i<1&&i>length) throw"查找位置非法";

else return data[i-1];

}

template <class DataType>

int SeqList<DataType>::Locate(DataType x)

{

int i;

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

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

return 0;

}

template <class DataType>

void SeqList<DataType>::Insert(int i,DataType 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++;

}

template <class DataType>

bool SeqList<DataType>::Delete(int i)

{

if(i<0 || i>length) return false;

    for(int j=i-1; j< length; j++){

        data[j] = data[j+1];

    }

    length--;

    return true;

}

template <class DataType>

void SeqList<DataType>::PrintList()

{

int i;

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

cout<<data[i];

}

int main()

{

SeqList<int> seq;

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

seq.CreateList(arr,5);

seq.PrintList();

  cout<<endl;

cout<<"SeqList length is "<<seq.Length()<<endl;

    cout<<"The second number is"<<seq.Get(2)<<endl;

seq.Insert(4,6);

seq.Locate(4);

seq.PrintList();

cout<<endl;

seq.Delete(1);

seq.PrintList();

return 0;

}

程序结果如下：