LinkList万能模板

//这只是一个模板，没有任何输出，可以按照个人的喜好对程序进行个性化的输出// 头文件”LinkList.h”如下
#ifndef LINKLIST_H
#define LINKLIST_H
template <typename Type> class Node
{
//friend class LinkList;
public:
Node();
Node(const Type &item);
~Node();
Type data;
Node<Type> *next;
};
template <typename Type> class LinkList
{
public:
LinkList();
~LinkList();
int length();
bool empty(){ return head->next == NULL; }
Node<Type> *getHead(){ return head; }
Type getElem(int i);
Type operator[](int i);
LinkList& operator=(LinkList& SrcList);
void makeEmpty();
void push_back(const Type &val);
void pop_back();
private:
Node<Type> *head;
};
template <typename Type> Node<Type>::Node(): next(NULL)
{
}
template <typename Type> Node<Type>::Node(const Type &data) : data(data), next(NULL) {
}
template <typename Type> Node<Type>::~Node()
{
}
template <typename Type> LinkList<Type>::LinkList()
{
head = new Node<Type>();//create a head node
}
template <typename Type> LinkList<Type>::~LinkList()//no implement
{
makeEmpty();
delete head;
}
template <typename Type> int LinkList<Type>::length()
{
int i = 0;
Node<Type> *ptr = head;
while(ptr->next != NULL)
{
ptr = ptr->next;
i++;
}
return i;
}
template <typename Type> Type LinkList<Type>::getElem(int i)
{
Node<Type> *ptr = head->next;
int j;
for(j = 0; j < i; j++)
{
ptr = ptr->next;
}
return ptr->data;
}
template <typename Type> void LinkList<Type>::makeEmpty()
{
if(head->next == NULL)
return;
Node<Type> *ptr;
while(head->next != NULL)
{
ptr = head->next;
head->next = ptr->next;
delete ptr;
}
}
template <typename Type> void LinkList<Type>::push_back(const Type &val) {
Node<Type> *newNode = new Node<Type>(val);
Node<Type> *back;
back = head;
while(back->next != NULL) //找到尾部节点
back = back->next;
back->next = newNode;
}
template <typename Type> Type LinkList<Type>::operator[](int i)
{
return getElem(i);
}
//A=B
template <typename Type>
LinkList<Type>& LinkList<Type>::operator=(LinkList& SrcList)
{
makeEmpty();
Node<Type> *ptr= SrcList.getHead();
ptr = ptr->next; //头节点不复制
while(ptr != NULL)
{
this->push_back(ptr->data);
ptr = ptr->next ;
}
return *this;
}
template <typename Type> void LinkList<Type>::pop_back( ) {
Node<Type> *back;
back = head;
if(back->next != NULL)
{
while(back->next->next != NULL) //找到尾部节点back = back->next;
delete back->next;
back->next = NULL;
}
}
#endif
//主函数文件”main.cpp”
#include <iostream>
#include <string>
#include "LinkList.h"
using namespace std;
int main()
{
/*
LinkList<string> *L1 = new LinkList<string>;
//int val;
L1->push_back("asdfsadfas");
L1->push_back("sdfsadfasdf");
*/
LinkList<int> *L = new LinkList<int>;
//int val;
L->push_back(3);
L->push_back(5);
L->pop_back();
LinkList<int> CopyedList;
CopyedList = *L;
return 0;
}。