通用链表

最新推荐文章于 2024-10-17 21:31:14 发布

congcuipu0914

最新推荐文章于 2024-10-17 21:31:14 发布

阅读量125

点赞数

文章标签：数据结构与算法

通用单向链表，使用模板(template)。

[@more@]

#include
using namespace std;

template class List
{
public:
List();
void Add(T&);
void Remove(T&);
T* Find(T&);
void PrintList();
~ List();
protected:
struct Node{
Node* pNext;
T* pT;
};
Node *pFirst;
};
template List::List()
{
pFirst=0;
}
template void List::Add(T& t)
{
Node* temp=new Node;
temp->pT=&t;
temp->pNext=pFirst;
pFirst=temp;
}
template void List::Remove(T& t)
{
Node* q=0;
if(*(pFirst->pT)==t)
{
q=pFirst;
pFirst=pFirst->pNext;
}else
{
for(Node* p=pFirst;p->pNext;p=p->pNext)
{
if(*(p->pNext->pT)==t)
{
q=p->pNext;
p->pNext=q->next;
break;
}
}
}
if(q)
{
delete q->pT;
delete q;
}
}
template T* List::Find(T& t)
{
for(Node* p=pFirst;p;p=p->pNext)
{
if(*(p->pT)==t)
{
return p->pT;
}
else
{
return 0;
}
}
}
template void List::PrintList()
{
for(Node* p=pFirst;p;p=p->pNext)
{
cout<pT)<}
cout<}
template List::~List()
{
Node* p;
while(p=pFirst)
{
pFirst=pFirst->pNext;
delete p->pT;
delete p;
}
}
int main()
{
List intlist;
for(int i=0;i<10;i++)
{
intlist.Add(* new int(i));
}
intlist.PrintList();
return 0;
}