数据结构第二章

顺序表
const int MaxSize=100;
template
class SeqList
{
public:
SeqList(){Length=0;}
SeqList(DataType a[],int n);
~SeqList(){}
int Length(){return length;}
DataType Get(int i);
int Locate(DataType x);
void Insert(int i,DataType x);
DataType Delete(int i);
void PrintList();
private:
DataType data[MaxSize];
int length;
};
template
SeqList::SeqList(DataType a[],int n)
{
int i;
if(n>MaxSize)throw"参数非法";
for(i=0;i data[i]=a[i];
length=n;
}
template
DataType SeqList::Get(int i)
{
if(i<1&&i>length)throw"查找位置非法";
else return data[i-1];
}
template
int SeqList::Locate(DataType x)
{
int i;
for(i=0;i if(data[i]x)return i+1;
return 0;
}
template
void SeqList::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
DataType SeqList::Delete(int i)
{
int x,j;
if(length0)throw"下溢";
if(i<1||i>length)throw"位置";
x=data[i-1];
for(j=i;j data[j-1]=data[j];
length–;
return x;
}
template
void SeqList::PrintList()
{
int i;
for(i=0;i cout< }
单链表
template
struct Node
{
DataType data;
Node*next;
};
template
class LinkList
{
public:
LinkList();
LinkList(DataType a[],int n);
~LinkList();
int Length();
DataType Get(int i);
int Locate(DataType x);
void Insert(int i,DataType x);
DataType Delete(int i);
void PrintList();
private:
Node*first;
};
template
void LinkList::PrintList()
{
Node*p;
p=first->next;
while(p!=NULL)
{
cout p=p->next;
}
}
template
int LinkList::Length()
{
Node*p;
p=first->next;
int count=0;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}
template
DataType LinkList::Get(int i)
{
Node*p;
int count=1;
p=first->next;
while(p!=NULL&&count {
p=p->next;
count++;
}
if(pNULL)throw"位置";
else return p->data;
}
template
int LinkList::Locate(DataType x)
{
Node*p;
int count=1;
p=first->next;
while(p!=NULL)
{
if(p->datax)return count;
p=p->next;
count++;
}
return 0;
}
template
void LinkList::Insert(int i,DataType x)
{
Node*p;
int count=0;
p=first;
while(p!=NULL&&count {
p=p->next;
count++;
}
if(pNULL)throw"位置";
else
{
Node*s;
s=new Node;
s->data=x;
s->next=p->next;
p->next=s;
}
}
template
LinkList::LinkList()
{
first=new Node;
first->next=NULL;
}
template
LinkList::LinkList(DataType a[],int n)
{
first=new Node;
Node*r;
r=first;
int i;
for(i=0;i {
Node*s;
s=new Node;
s->data=a[i];
r->next=s;
r=s;
}
r->next=NULL;
}
template
DataType LinkList::Delete(int i)
{
Node*p;
int count=0;
p=first;
while(p!=NULL&&count {
p=p->next;
count++;
}
if(pNULL||p->next==NULL)
throw"位置";
else
{
Node*q;
DataType x;
q=p->next;
x=q->data;
p->next=q->next;
delete q;
return x;
}
}
template
LinkList::~LinkList()
{
while(first!=NULL)
{
Node*q;
q=first;
first=first->next;
delete q;
}
}