C++模板实现的单向链表

C&＃43;&＃43;模板实现的单向链表&＃xff0c;实现了链表的初始化创建&＃xff0c;元素插入&＃xff0c;元素链表末尾添加&＃xff0c;元素删除&＃xff0c;链表清空

//Lists.h

#ifndef DDXXLISTS_H
#define DDXXLISTS_H
#include
using namespace std;
template
class Lists
{
public:Lists();Lists(int nSize);~Lists();
public:struct Node{Type e;Node* next;Node(){}Node(Type _e){e &＃61; _e;next &＃61; NULL;}};
public:bool insert(Type e,int pos);bool add(Type e);bool erase(int pos);void clear();bool isEmpty();int getLength();void print();
private:Node* m_head;int m_nLength;
};template Lists::Lists()
{Node *pPos &＃61; new Node;pPos->next &＃61; NULL;m_head &＃61; pPos;m_nLength &＃61; 0;
}template Lists::Lists(int nSize)
{m_nLength &＃61; nSize;Node *pPos &＃61; new Node;pPos->next &＃61; NULL;m_head &＃61; pPos;m_nLength &＃61; nSize;for (int i&＃61;0;inext &＃61; new Node;pPos &＃61; pPos->next;}
}template bool Lists::insert(Type e,int pos)
{if (pos >&＃61; m_nLength){cout<<"The position to insert out of range"<next;cnt&＃43;&＃43;;}Node *pNew &＃61; new Node(e);pNew->next &＃61; ptr->next;ptr->next &＃61; pNew;m_nLength&＃43;&＃43;;return true;}
}template bool Lists::add(Type e)
{Node *pNew &＃61; new Node(e);if (pNew &＃61;&＃61; NULL){cout<<"allocate memory for new node failed"<next !&＃61; NULL){ptr &＃61; ptr->next;}ptr->next &＃61; pNew;pNew->next &＃61; NULL;m_nLength&＃43;&＃43;;return true;}
}template bool Lists::erase(int pos)
{if (pos >&＃61; m_nLength){cout<<"The position to delete out of range"<next;i&＃43;&＃43;;}Node *pdel &＃61; ptr->next;ptr->next &＃61; ptr->next->next;delete pdel;pdel &＃61; NULL;m_nLength--;return true;}
}template void Lists::print()
{if(m_nLength &＃61;&＃61;0)cout<<"The list is empty"<next!&＃61; NULL){ptr &＃61; ptr->next;cout<<"element value:"<e<}template int Lists::getLength()
{return m_nLength;
}
template bool Lists::isEmpty()
{return m_head->next &＃61;&＃61; NULL;
}template void Lists::clear()
{Node *ptr &＃61; m_head->next;Node *ptmp &＃61; NULL;while(ptr !&＃61; NULL){ptmp &＃61; ptr;ptr &＃61; ptr->next;delete ptmp;ptmp &＃61; NULL;m_nLength--;}m_head->next &＃61; NULL;}
template Lists::~Lists()
{Node *ptr &＃61; m_head;Node *ptmp &＃61; NULL;while(ptr->next !&＃61; NULL){ptmp &＃61; ptr;ptr &＃61; ptr->next;delete ptmp;ptmp &＃61; NULL;}delete ptr;ptr &＃61; NULL;
}
#endif

//main.cpp

#include
#include "Lists.h"
using namespace std;
void main()
{cout<<"*************************Test list init***************************"< Lisa;cout<<"List&＃39;s length is:"<}

程序运行结果&＃xff1a;