template <typename T>
class CList
{
public:
struct SNode //定义节点
{
T data;//数据 区
SNode* pNext;//指针区 指向下一个节点
};
typedef SNode* POSITION; //定义类型
CList();
virtual ~CList();
void AddHead(const T&); //头部添加
POSITION GetTailPosition(); //获取头节点
POSITION GetHeadPosition(); //获取尾节点
void AddTail(const T&); //尾部添加
void RemoveAt(POSITION,int);//删除单个节点
void RemoveAll(); //全部删除
POSITION Look(int nNum,int &flag); //查找传入的数据的节点
private:
POSITION m_pHead; //定义头节点
};
template <typename T>
CList<T>::CList()
{
m_pHead=NULL;
CList<T>::~CList()
{
RemoveAll();
}
template <typename T>
void CList<T>::AddHead(const T& data)
{
SNode* p=new SNode;
p->data=data;
p->pNext=m_pHead;
m_pHead=p;
}
template <typename T>
CList<T>::POSITION CList<T>::GetTailPosition()
{
POSITION p=m_pHead;
if(m_pHead==NULL)
return NULL;
while(p->pNext)
{
p=p->pNext; //把p指针向后移动;
}
return p;
}
template <typename T>
CList<T>::POSITION CList<T>::GetHeadPosition()
{
return m_pHead;
}
template <typename T>
void CList<T>::AddTail(const T& data)
{
POSITION p_Tail=GetTailPosition();
POSITION p=new SNode;
if(p_Tail==NULL) //判断链表是否为空
{
p->data=data;
p->pNext=NULL;
m_pHead=p;
}
else
{
p->data=data;
p->pNext=NULL;
p_Tail->pNext=p;
}
}
template <typename T>
void CList<T>::RemoveAt(POSITION pos,int flag)
{
if(pos==m_pHead&&flag==1)//flag=1 删除为头节点
{
m_pHead=pos->pNext;
delete pos;
return ;
}
SNode* q=pos->pNext;
pos->pNext=pos->pNext->pNext;
delete q;
}
template <typename T>
void CList<T>::RemoveAll()
{
POSITION p=m_pHead,q=p;
while(p)
{
q=p;
p=p->pNext;
delete q;
}
m_pHead=NULL;
}
template <typename T>
CList<T>::POSITION Look(int nNum,int &flag)
{
POSITION p= GetHeadPosition();
POSITION q=p;
if(p==NULL)
return NULL;
if(p->data==nNum)
{
flag=1;
return p;
}
while(p!=NULL)
{
if(p->data==nNum)// p当前节点
{
return q;
}
q=p;
p=p->pNext; //保证q是p前面一个节点指针
}
return NULL;
//找到的当前节点 为头结点
//找到的节点 为头节点的后一个节点 传递的值为头节点
}
class CList
{
public:
struct SNode //定义节点
{
T data;//数据 区
SNode* pNext;//指针区 指向下一个节点
};
typedef SNode* POSITION; //定义类型
CList();
virtual ~CList();
void AddHead(const T&); //头部添加
POSITION GetTailPosition(); //获取头节点
POSITION GetHeadPosition(); //获取尾节点
void AddTail(const T&); //尾部添加
void RemoveAt(POSITION,int);//删除单个节点
void RemoveAll(); //全部删除
POSITION Look(int nNum,int &flag); //查找传入的数据的节点
private:
POSITION m_pHead; //定义头节点
};
template <typename T>
CList<T>::CList()
{
m_pHead=NULL;
}
CList<T>::~CList()
{
RemoveAll();
}
template <typename T>
void CList<T>::AddHead(const T& data)
{
SNode* p=new SNode;
p->data=data;
p->pNext=m_pHead;
m_pHead=p;
}
template <typename T>
CList<T>::POSITION CList<T>::GetTailPosition()
{
POSITION p=m_pHead;
if(m_pHead==NULL)
return NULL;
while(p->pNext)
{
p=p->pNext; //把p指针向后移动;
}
return p;
}
template <typename T>
CList<T>::POSITION CList<T>::GetHeadPosition()
{
return m_pHead;
}
template <typename T>
void CList<T>::AddTail(const T& data)
{
POSITION p_Tail=GetTailPosition();
POSITION p=new SNode;
if(p_Tail==NULL) //判断链表是否为空
{
p->data=data;
p->pNext=NULL;
m_pHead=p;
}
else
{
p->data=data;
p->pNext=NULL;
p_Tail->pNext=p;
}
}
template <typename T>
void CList<T>::RemoveAt(POSITION pos,int flag)
{
if(pos==m_pHead&&flag==1)//flag=1 删除为头节点
{
m_pHead=pos->pNext;
delete pos;
return ;
}
SNode* q=pos->pNext;
pos->pNext=pos->pNext->pNext;
delete q;
}
template <typename T>
void CList<T>::RemoveAll()
{
POSITION p=m_pHead,q=p;
while(p)
{
q=p;
p=p->pNext;
delete q;
}
m_pHead=NULL;
}
template <typename T>
CList<T>::POSITION Look(int nNum,int &flag)
{
POSITION p= GetHeadPosition();
POSITION q=p;
if(p==NULL)
return NULL;
if(p->data==nNum)
{
flag=1;
return p;
}
while(p!=NULL)
{
if(p->data==nNum)// p当前节点
{
return q;
}
q=p;
p=p->pNext; //保证q是p前面一个节点指针
}
return NULL;
//找到的当前节点 为头结点
//找到的节点 为头节点的后一个节点 传递的值为头节点
}