• 单链表


    template<typename Type> class SingleList;
    
    template<typename Type> class ListNode{
    private:
    	friend typename SingleList<Type>;
    
    	ListNode():m_pnext(NULL){}
    	ListNode(const Type item,ListNode<Type> *next=NULL):m_data(item),m_pnext(next){}
    	~ListNode(){
    		m_pnext=NULL;
    	}
    
    public:
    	Type GetData();
    	friend ostream& operator<< <Type>(ostream& ,ListNode<Type>&);
    
    private:
    	Type m_data;
    	ListNode *m_pnext;
    };
    
    template<typename Type> Type ListNode<Type>::GetData(){
    	return this->m_data;
    }
    
    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();                       //make the list empty
    	int Length();                           //get the length
    	ListNode<Type> *Find(Type value,int n); //find thd nth data which is equal to value
    	ListNode<Type> *Find(int n);            //find the nth data
    	bool Insert(Type item,int n=0);         //insert the data in the nth position
    	Type Remove(int n=0);                   //remove the nth data
    	bool RemoveAll(Type item);              //remove all the data which is equal to item
    	Type Get(int n);                        //get the nth data
    	void Print();                           //print the list
    
    private:
    	ListNode<Type> *head;
    };
    
    template<typename Type> void SingleList<Type>::MakeEmpty(){
    	ListNode<Type> *pdel;
    	while(head->m_pnext!=NULL){
    		pdel=head->m_pnext;
    		head->m_pnext=pdel->m_pnext;
    		delete pdel;
    	}
    }
    
    template<typename Type> int SingleList<Type>::Length(){
    	ListNode<Type> *pmove=head->m_pnext;
    	int count=0;
    	while(pmove!=NULL){
    		pmove=pmove->m_pnext;
    		count++;
    	}
    	return count;
    }
    
    template<typename Type> ListNode<Type>* SingleList<Type>::Find(int n){
    	if(n<0){
    		cout<<"The n is out of boundary"<<endl;
    		return NULL;
    	}
    	ListNode<Type> *pmove=head->m_pnext;
    	for(int i=0;i<n&&pmove;i++){
    		pmove=pmove->m_pnext;
    	}
    	if(pmove==NULL){
    		cout<<"The n is out of boundary"<<endl;
    		return NULL;
    	}
    	return pmove;
    }
    
    template<typename Type> ListNode<Type>* SingleList<Type>::Find(Type value,int n){
    	if(n<1){
    		cout<<"The n is illegal"<<endl;
    		return NULL;
    	}
    	ListNode<Type> *pmove=head;
    	int count=0;
    	while(count!=n&&pmove){
    		pmove=pmove->m_pnext;
    		if(pmove->m_data==value){
    			count++;
    		}
    
    	}
    	if(pmove==NULL){
    		cout<<"can't find the element"<<endl;
    		return NULL;
    	}
    	return pmove;
    }
    
    template<typename Type> bool SingleList<Type>::Insert(Type item, int n){
    	if(n<0){
    		cout<<"The n is illegal"<<endl;
    		return 0;
    	}
    	ListNode<Type> *pmove=head;
    	ListNode<Type> *pnode=new ListNode<Type>(item);
    	if(pnode==NULL){
    		cout<<"Application error!"<<endl;
    		return 0;
    	}
    	for(int i=0;i<n&&pmove;i++){
    		pmove=pmove->m_pnext;
    	}
    	if(pmove==NULL){
    		cout<<"the n is illegal"<<endl;
    		return 0;
    	}
    	pnode->m_pnext=pmove->m_pnext;
    	pmove->m_pnext=pnode;
    	return 1;
    }
    
    template<typename Type> bool SingleList<Type>::RemoveAll(Type item){
    	ListNode<Type> *pmove=head;
    	ListNode<Type> *pdel=head->m_pnext;
    	while(pdel!=NULL){
    		if(pdel->m_data==item){
    			pmove->m_pnext=pdel->m_pnext;
    			delete pdel;
    			pdel=pmove->m_pnext;
    			continue;
    		}
    		pmove=pmove->m_pnext;
    		pdel=pdel->m_pnext;
    	}
    	return 1;
    }
    
    template<typename Type> Type SingleList<Type>::Remove(int n){
    	if(n<0){
    		cout<<"can't find the element"<<endl;
    		exit(1);
    	}
    	ListNode<Type> *pmove=head,*pdel;
    	for(int i=0;i<n&&pmove->m_pnext;i++){
    		pmove=pmove->m_pnext;
    	}
    	if(pmove->m_pnext==NULL){
    		cout<<"can't find the element"<<endl;
    		exit(1);
    	}
    	pdel=pmove->m_pnext;
    	pmove->m_pnext=pdel->m_pnext;
    	Type temp=pdel->m_data;
    	delete pdel;
    	return temp;
    }
    
    template<typename Type> Type SingleList<Type>::Get(int n){
    	if(n<0){
    		cout<<"The n is out of boundary"<<endl;
    		exit(1);
    	}
    	ListNode<Type> *pmove=head->m_pnext;
    	for(int i=0;i<n;i++){
    		pmove=pmove->m_pnext;
    		if(NULL==pmove){
    			cout<<"The n is out of boundary"<<endl;
    			exit(1);
    		}
    	}
    	return pmove->m_data;
    }
    
    template<typename Type> void SingleList<Type>::Print(){
    	ListNode<Type> *pmove=head->m_pnext;
    	cout<<"head";
    	while(pmove){
    		cout<<"--->"<<pmove->m_data;
    		pmove=pmove->m_pnext;
    	}
    	cout<<"--->over"<<endl<<endl<<endl;
    }
    

    test.cpp
    #include <iostream>
    using namespace std;
    
    #include "SingleList.h"
    
    
    int main()
    {
    	SingleList<int> list;
    	for(int i=0;i<20;i++){
    		list.Insert(i*3,i);
    	}
    	for(int i=0;i<5;i++){
    		list.Insert(3,i*3);
    	}
    	cout<<"the Length of the list is "<<list.Length()<<endl;
    	list.Print();
    
    	list.Remove(5);
    	cout<<"the Length of the list is "<<list.Length()<<endl;
    	list.Print();
    
    	list.RemoveAll(3);
    	cout<<"the Length of the list is "<<list.Length()<<endl;
    	list.Print();
    
    	cout<<"The third element is "<<list.Get(3)<<endl;
    
    	cout<<*list.Find(18,1)<<endl;
    
    	list.Find(100);
    
    	list.MakeEmpty();
    	cout<<"the Length of the list is "<<list.Length()<<endl;
    	list.Print();
    
    	return 0;
    }
    
  • 相关阅读:
    2019.8.8 python day03
    2019.8.7 python进阶day02
    2019.8.6(python day01)
    2019.8.5
    2019.8.2
    2019.8.1
    2019.7.31
    2019.7.30
    面向对象进阶
    访问可见性问题和@property装饰器
  • 原文地址:https://www.cnblogs.com/rollenholt/p/2438183.html
Copyright © 2020-2023  润新知