20176510遥感一班李长宁

@李长宁的笔记
单链表的交集
#include

using namespace std;

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();
void ChaChong();
private:
Node *first;
};

template
void LinkList::ChaChong()
{
int i,j;
for(i=1;i<Length();i++)
{
for(j=1;j<Length();j++)
{
if(i==j) continue;
else
{
if(Get(i)==Get(j))
{
Delete(j);
j–;
}
else continue;
}
}
}
}

int main()
{

//以下是测试成员函数
cout<<“以下是测试成员函数:”<<endl;
int ning[]={2,4,5,3,2};
LinkList dlb1();
LinkList dlb2(ning,5);
dlb2.PrintList();
cout<<endl;
cout <<dlb2.Get(3)<<endl;
cout <<dlb2.Locate(5)<<endl;
dlb2.Insert(3,2);
dlb2.PrintList();
cout <<endl;
cout<<dlb2.Delete(3)<<endl;
dlb2.PrintList();
cout<<endl;
dlb2.ChaChong();
dlb2.PrintList();
//正式开始写

cout<<endl<<endl<<endl<<endl;
int i,j,x,y,b3[5],b4[5];
cout<<"第一个单链表,请输入五个数:"<<endl;
for(j=0;j<5;j++)
{
	cin>>y;
	b3[j]=y;
}
cout<<"第二个单链表，请输入五个数:"<<endl;
for(j=0;j<5;j++)
{
	cin>>y;
	b4[j]=y;
}

LinkList <int> dlb3(b3,5);
LinkList <int> dlb5(b4,5);

//单链表的交
for(i=1;i<=dlb5.Length();i++)
{
x=dlb5.Get(i);
if(dlb3.Locate(x)==0)
{
dlb5.Delete(i);
i–;
}
else continue;
}
dlb5.ChaChong();
cout<<endl<<“单链表的交为:”<<endl;
dlb5.PrintList();

}

template
void LinkList::PrintList()
{
Node *p;
p=first->next;
while(p!=NULL)
{
cout<data<<" ";
p=p->next;
}
}

template
int LinkList::Length()
{
int count;
Node *p;
p=first->next;count=0;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}

template
DataType LinkList::Get(int i)
{
int count;
Node *p;
p=first->next;count=1;
while(p!=NULL&&count<i)
{
p=p->next;
count++;
}
if(p==NULL)throw"位置";
else return p->data;
}

template
int LinkList::Locate(DataType x)
{
int count;
Node *p;
p=first->next;count=1;
while(p!=NULL)
{
if(p->data==x)return count;
p=p->next;
count++;
}
return 0;
}

template
void LinkList::Insert(int i,DataType x)
{
int count;
Node *p,s;
p=first;count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(p==NULL)throw"";
else
{
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)
{
int i;
Node *s;
first=new Node;first->next=NULL;
for(i=0;i<n;i++)
{
s=new Node;s->data=a[i];
s->next=first->next;first->next=s;
}
}
*/
//尾插法

template
LinkList::LinkList(DataType a[],int n)
{
int i;
Node*s,*r;
first=new Node;
r=first;
for(i=0;i<n;i++)
{
s=new Node;s->data=a[i];
r->next=s;r=s;
}
r->next=NULL;
}

template
DataType LinkList::Delete(int i)
{
int x,count;
Node *p,*q;
p=first;count=0;
while(p!=NULL&&count<i-1)
{
p=p->next;
count++;
}
if(pNULL||p->nextNULL)
throw"位置";
else
{
q=p->next;x=q->data;
p->next=q->next;
delete q;
return x;
}
}

template
LinkList ::~LinkList()
{
Node *q;
while(first!=NULL)
{
q=first;
first=first->next;
delete q;
}
}