单链表

单链表类模板节点头

ListNode.h

#include "stdafx.h"
#include<iostream>
using namespace std ;
template<typename Type> class SingleList;
template <typename Type>
class ListNode{
private: 
    friend class SingleList<Type>;
    ListNode():m_next(NULL){}
    ListNode(const Type item , ListNode<Type>*next=NULL):m_data(item),m_next(next){}
    ~ListNode(){m_next=NULL;}
public:
    Type getData(){return m_data ; }
    friend ostream& operator<<(ostream&,ListNode<Type>&);
private:
    Type m_data;
    ListNode *m_next;
};
template<typename Type>
ostream& operator<<(ostream& os , ListNode<Type>& out){
    os << out.m_data;
    return os;
}

单链表头

SingleList.h

#include "ListNode.h"
template<typename Type>
class SingleList{
public:
    SingleList(){head = new ListNode<Type>;}
    ~SingleList(){
    makeEmpty();
    delete head;
    }
public:
    void makeEmpty();
    int length();
    ListNode<Type>* find(Type item , int n)const;
    ListNode<Type>* find(int n)const;
    bool insert(Type item, int n =0);
    Type remove(int n);
    bool removeAll(Type item);
    Type get(int n);
    void ReverseSinglyLinkedList();
    void print();
private:
    ListNode<Type> *head;
};
template <typename Type>
void SingleList<Type>::makeEmpty(){
    ListNode<Type> * pdel = NULL;
    while(head->m_next!=NULL){
        pdel = head->m_next;
        head->m_next = pdel->m_next;
        delete pdel;
    }
}
template <typename Type>
int SingleList<Type>::length(){
    int count = 0 ;
    ListNode <Type> *p = head->m_next;
    while (p!=NULL){
        p = p->m_next;
        count++;
    }
    return count;
}
template<typename Type>
ListNode<Type>*SingleList<Type>::find(int n)const{
    if(n<0){cout << "out of the boundary"<< endl ;return NULL;}
    ListNode<Type>* p = head;
    for(int i =0 ; i<=n&&p ;i++){
        p = p->m_next;
    }
    if(p==NULL){
        cout << "can't find the element"<<endl;
        return NULL;
    }
    return p;
}
template<typename Type>
ListNode<Type>*  SingleList<Type>::find(Type item , int n)const{
    if(n<1){
        cout << "the n is illegal" << endl;
        return NULL;
    }
    ListNode<Type> *p = head;
    int count = 0;
    while(count!=n && p){
        p=p->m_next;
        if(p->m_data==item)
        count++;
    }
    if(p==NULL){
        cout << "can't find the element"<<endl;
        return NULL;
    }
    return p;
}
template<typename Type>
bool SingleList<Type>::insert(Type item, int n=0){
    ListNode<Type> *p = head;
    if(n<0){
        cout << "the n is illegal"<<endl;
        return false;
    }
    ListNode<Type>* pnode = new ListNode<Type>(item);
    ListNode<Type>* pmove = head;
    if(pnode==NULL){
        cout << "Application is error "<< endl;
        return false;
    }
    for(int i = 0 ; i<n&&pmove; i++){
        pmove = pmove->m_next;
    }
    if(pmove==NULL){
        cout << "the n is illegal " << endl;
        return false;
    }
    pnode->m_next = pmove->m_next;
    pmove->m_next = pnode;
    return true;
}
template<typename Type>
Type SingleList<Type>::remove(int n){
    if(n<0){
        cout << "can't find th element"<<endl;
        exit(0);
    }
    ListNode<Type>* pmove=head ,*pdel;
    for(int i = 0 ; i<n&&pmove ; i++){
        pmove = pmove->m_next;
    }
    if(pmove->m_next==NULL){
        cout << "can't find the element" <<endl;
        exit(0);
    }
    pdel = pmove->m_next;
    pmove->m_next = pdel->m_next;
    Type item = pdel->m_data;
    delete pdel;
    return item;
}
template <typename Type>
bool SingleList<Type>::removeAll(Type item){
    ListNode<Type> *pmove = head,*pdel = pmove->m_next;
    while(pdel!=NULL){
        if(pdel->m_data==item){
            pmove->m_next = pdel->m_next;
            delete pdel;
            pdel = pmove->m_next;
            continue;
        }
        pmove=pmove->m_next;
        pdel = pdel->m_next;
        pmove = pmove->m_next;
    }
    return true;
}
template<typename Type>
Type SingleList<Type>::get(int n){
    if(n<0){
        cout << "can't find the element "<<endl;
        exit(0);
    }
    ListNode<Type> *pmove =head->m_next;
    for(int i =0 ; i<n ; i++){
        pmove = pmove->m_next;
        if(NULL == pmove){
            cout << "can't find the element "<<endl;
            exit(0);
        }
    }
    return  pmove->m_data;
}
template <typename Type>
void SingleList<Type>::print(){
    ListNode<Type> *pmove = head->m_next;
    cout << "head";
    while (pmove!=NULL){
        cout << "->" << pmove->m_data;
        pmove = pmove->m_next;
    }
    cout << endl;
}
template<typename Type>
void SingleList<Type>::ReverseSinglyLinkedList(){
    if(head->m_next==NULL)return;
    ListNode<Type> *pmove = head->m_next;
    ListNode<Type> *temp ;
    while(pmove->m_next!=NULL){
        temp = pmove->m_next;
        pmove->m_next = temp->m_next;
        temp->m_next = head->m_next;
        head->m_next = temp;
    }
}