线性表运算--链式存储结构模板类实现

采用C++模板类实现

#ifndef _List_H_
#define _List_H_
#include <iostream>
#include "stdlib.h"
template <class T>
class CNode
{
public:
    T data;
    CNode<T> *next;
};
template <class T>
class CLink
{
public:
    CLink();
    CLink(const CNode<T> &init_data);            
    ~CLink();
    void InsertHead(const T &data);              //从头插入节点
    bool Insert(const int pos,const T &data );   //在pos位置之前插入data;
    bool Delete(const int pos);                  //删除第Pos个元素
    int  Get_Length()const;                      //获得链表长度
    bool Find_Data(const T& data)const;          //返回链表中是否存在data.
    bool IsEmpty() const;                        //判断链表是否为空
    bool SetAt(const int pos,const T& data);     //将位置pos的值设为data
    void Remove();                               //清空链表
    void Print()const;                           //打印链表中的内容
protected:
    CNode<T> *head;
    int Count;                                   //记录链表中元素个数

};


template <class T>
CLink<T>::CLink()
{
    head = new CNode<T>;
    head->next=NULL;
    Count = 0;
}
template <class T>
CLink<T>::~CLink()
{
        if(head->next!=NULL)
        {
             CNode<T>* p = head;
             CNode<T>* q;
         while (p->next!=NULL)
         {
            q = p->next;
            p->next = q->next;
            delete q;
        }
    delete head;
}
template <class T>
CLink<T>::CLink(const CNode<T> &initdata)
{
    head = new CNode<T>;
    head->next = NULL;
    head->data = initdata;
    Count = 0;
}
template <class T>
void CLink<T>::InsertHead(const T& data)
{
    CNode<T> *newnode = new CNode<T>;
    newnode->data = data;
    newnode->next = head->next;
    head->next = newnode;
    ++Count;
}
template <class T>
void CLink<T>::Print()const
{
    CNode<T>* p = new CNode<T>;
    p = head;
    while(p->next)
    {
        p = p->next;
        std::cout<<p->data<<" ";    
    }
}
template <class T>
bool CLink<T>::Insert(const int pos,const T& data)
{
    int i=1;
    if (pos>Count+1||pos<1)
    {
        std::cout<<"插入位置不存在"<<std::endl;
        return false;
    }
    else
    {
        CNode<T>* newNode = new CNode<T>;
        CNode<T>* p = head->next;
        newNode->data = data;
        while(i<=Count&&i!=pos-1)
        {
            i++;
            p = p->next;
        }
        newNode->next = p->next;
        p->next = newNode;
        ++Count;
        return true;
    }
}
template <class T>
bool CLink<T>::Delete(const int pos)
{
    int i = 0;              //应该从0开始，注意删除首元节点
    if (pos<1||pos>Count)
    {
        std::cout<<"删除元素不存在"<<std::endl;
        return false;
    }
    else
    {
        CNode<T>* p = head;
        CNode<T>* q;
        while(i<=Count-1&&i!=pos-1)
        {
            i++;
            p = p->next;
        }
        q = p->next;
        p->next = q->next;
        delete q;
        --Count;
        return true;
    }
}
template<class T>
bool CLink<T>::Find_Data(const T& data)const
{
    if(!Count||!(head->next))
    {
        return false;
    }
    else
    {
        CNode<T>* p =head->next;
        while (p->data !=data&&p->next!=NULL)
        {
            p = p->next;
        }
        if(!p->next)
        {
            std::cout<<"链表中不存在数据data"<<std::endl;
            return false;
        }
        else
        {
            std::cout<<"链表中存在数据data"<<std::endl;
            return true;
        }
    }
}
template <class T>
bool CLink<T>::IsEmpty() const
{
    if(!head||0==Count)
    {
        return true;
    }
    else
    {
        return false;
    }
}
template <class T>
bool CLink<T>::SetAt(const int pos,const T& data)
{
    int i = 0;
    if(!head||pos<1||pos>Count)
    {
        return false;
    }
    else
    {
        CNode<T>* p = head;
        while(i<=Count&&i!=pos)
        {
            p = p->next;
            i++;
        }
        p->data = data;
        return true;
    }

}
template <class T>
void CLink<T>::Remove()
{
    if(!head->next)
    {
        std::cout<<"链表为空"<<std::endl;
    }
    else
    {
        CNode<T>* p = head;
        CNode<T>* q;
        while (p->next!=NULL)
        {
            q = p->next;
            p->next = q->next;
            delete q;
        }
        std::cout<<"链表清除成功"<<std::endl;
    }
}
template <class T>
int CLink<T>::Get_Length()const
{
   return Count;
}

#endif//_List_H_