泛型编程实现链表

泛型编程实现链表

#ifndef _LIST_H_

#define _LIST_H_
#include <iostream>
using namespace std;
template<typename T>
class Node
{
public:
T data;
Node *next;
};


template<typename T>
class List
{
public:
List();
~List();
void FirstInsert(const T& e);
void LastInsert(const T& e);
int Length();
bool GetElementByIndex(int index, int &e);
void Print();
void Destory();
private:
Node<T> *head;
};
#endif


template<typename T>
List<T>::List()
{
head = new Node<T>();
head->next = nullptr;
}


template<typename T>
List<T>::~List()
{
Destory();
delete head;
}


template<typename T>
void List<T>::FirstInsert(const T& e)
{
Node<T> *temp = new Node<T>();
temp->data = e;
temp->next = head->next;
head->next = temp;
}




template<typename T>
void List<T>::LastInsert(const T& e)
{
Node<T> *temp = new Node<T>();
temp->data = e;
Node<T> *index = head;
while (index->next != nullptr)
{
index = index->next;
}
temp->next = index->next;
index->next = temp;
}


template<typename T>
int List<T>::Length()
{
Node<T> *index = head;
int length = 0;
while (index->next != nullptr)
{
index = index->next;
++length;
}
return length;
}


template<typename T>
bool List<T>::GetElementByIndex(int index,int &e)
{
Node<T> *temp = head;
int length = 0;
while (temp->next != nullptr)
{
temp = temp->next;
++length;
if (length == index)
{
e = temp->data;
return true;
}
}
return false;
}


template<typename T>
void List<T>::Print()
{
Node<T> *index = head;
while (index->next != nullptr)
{
index = index->next;
cout << index->data << " ";
}
cout << endl;
}


template<typename T>
void List<T>::Destory()
{
Node<T> *temp = nullptr;
Node<T> *index = head->next;
while (index != nullptr)
{
temp = index;
index = index->next;
delete temp;
}
head->next = nullptr;

}