数据结构顺序表debug assertion failed

Question

//文件linearlist.h
#include
template
class LinearList
{
public:
virtual bool Isempty()const=0;
virtual int Length()const=0;
virtual bool Find(int i,T &x)const=0;
virtual int Search(T x)const=0;
virtual bool Insert(int i,T x)=0;
virtual bool Delete(int i)=0;
virtual bool Update(int i,T x)=0;
virtual void Output(ostream& out)const=0;
protected:
int n;
};

//文件seqlist.h
#include"linearlist.h"
template
class SeqList:public LinearList
{
public:
SeqList(int mSize);
~SeqList(){delete [] elements;}
bool Isempty()const;
int Length()const;
bool Find(int i,T& x)const;
int Search(T x)const;
bool Insert(int i,T x);
bool Delete(int i);
bool Update(int i,T x);
void Output(ostream& out)const;
void Reverse();
bool DeleteX(const T& x);
private:
int maxLength;
T *elements;
};
template
SeqList::SeqList(int mSize)
{
maxLength=mSize;
elements=new T[maxLength];
n=0;
}
template
bool SeqList::Isempty()const{return n==0;}
template
int SeqList::Length()const{return n;}
template
bool SeqList::Find(int i,T& x)const
{
if(in-1)
{
cout<<"Out of Bounds"< return false;
}
x=elements[i];
return true;
}
template
int SeqList::Search(T x)const
{
for(int j=0;j if(elements[j]==x)
return j;
return -1;
}
template
bool SeqList::Insert(int i,T x)
{
if(i<-1||i>n-1)
{
cout<<"Out of Bounds"< return false;
}
if(n==maxLength)
{
cout return false;
}
for(int j=n-1;j>i;j--)
elements[j+i]=elements[j];
elements[i+1]=x;
n++;
return true;
}
template
bool SeqList::Delete(int i)
{
if(!n)
{
cout<<"UnderFlow"< return false;
}
if(in-1)
{
cout<<"Out of Bounds"< return false;
}
for(int j=i+1;j elements[j-1]=elements[j];
n--;
return true;
}
template
bool SeqList::Update(int i,T x)
{
if(in-1)
{
cout<<"Out of Bounds"< return false;
}
elements[i]=x;
return true;
}
template
void SeqList::Output(ostream& out)const
{
for(int i=0;i out out }
template
void SeqList::Reverse()
{
int x;
for(int j=0;j<=n/2;j++)
{
x=elements[j];
elements[j]=elements[n-1-j];
elements[n-1-j]=x;
}
}
template
bool SeqList::DeleteX(const T& x)
{
int booln=n;
for(int i=0;i<n;i++)
if(elements[i]==x)
{
Delete(i);
i--;
}
if(booln!=n)
return true;
return false;
}

//main函数
#include"seqlist.h"
const int SIZE=20;
template
void Union(SeqList &LA,SeqList LB)
{
T x;
for(int i=0;i {
LB.Find(i,x);
if(LA.Search(x)==-1)
LA.Insert(LA.Length()-1,x);
}
}
void main()
{
SeqList LA(SIZE);
SeqList LB(SIZE);
cout<<"Please input LA:";
for(int i=-1;i {
int n;
cin>>n;
LA.Insert(i,n);
}
cout<<"Please input LB:";
for(i=-1;i {
int n;
cin>>n;
LB.Insert(i,n);
}
Union(LA,LB);
LA.Output(cout);
// Same(LA,LB);
// LA.Output(cout);
// Different(LA,LB);
// LA.Output(cout);
return;
}