C++ Template List(part)

18 篇文章 0 订阅
9 篇文章 0 订阅
#include <iostream>
using namespace std;
template<typename T> class mynode
{
public: 
	T m_obj;


	mynode * m_next;
};
 template<typename T> class myList
{
public:
	myList()
	{
		m_header=NULL;
	}
	void create( T val);
	void addtotail( T val);
	void printflist();
private: 
	mynode<T>* m_header;
};
 template<typename T> void myList<T> ::create( T val)
 {
	 if (m_header==NULL)
	 {
		 m_header=new mynode<T>;
		 m_header->m_next=NULL;
		 m_header->m_obj=val;
	 }
	 
 }
 template<typename T> void myList<T>::addtotail(T val)
 {
	 if (m_header!=NULL)
	 {
		 mynode<T>* pcurrent=m_header;
		 cout<< "add of header " <<pcurrent<<endl;
		 cout<< "add of  next header " <<pcurrent->m_next<<endl;
		 while (pcurrent->m_next!=NULL)
			
			 pcurrent=pcurrent->m_next;
		 mynode<T>* pNewNode=new mynode<T>;
		 pcurrent->m_next=pNewNode;
		 pNewNode->m_next=0;
		 pNewNode->m_obj=val;
	 }
 }
 template<typename T> void myList<T>::printflist()
 {
	 if (m_header!=NULL)
	 {
		 mynode<T>* pcurrent=m_header;
		 while (pcurrent->m_next)
			{ 
				cout<<pcurrent->m_obj <<endl;
				pcurrent=pcurrent->m_next;
		    }
	 }


 }
 int main()
 {


	 myList<int> mylist1;
	 mylist1.create(0);
	 	// mylist1.addtotail(1);
	 for (int k=0;k<12;k++)
	 {
		 mylist1.addtotail(k);
	 }
	 mylist1.printflist();
	 int gfl;
	 cin>>gfl;
 }



// 做了区分  list  node 的节点不一样

#include <iostream>
using namespace std;
template<typename T> class mynode
{
public: 
	T m_obj;

	mynode * m_next;
};
 template<typename T, typename T1> class myList
{
public:
	myList()
	{
		m_header=NULL;
	}
	void create( T1 val);
	void addtotail( T1 val);
	void printflist();
private: 
	mynode<T1>* m_header;
};
 template<typename T,typename T1> void myList<T,T1> ::create( T1 val)
 {
	 if (m_header==NULL)
	 {
		 m_header=new mynode<T1>;
		 m_header->m_next=NULL;
		 m_header->m_obj=val;
	 }
	 
 }
 template<typename T,typename T1> void myList<T,T1>::addtotail(T1 val)
 {
	 if (m_header!=NULL)
	 {
		 mynode<T1>* pcurrent=m_header;
		 cout<< "add of header " <<pcurrent<<endl;
		 cout<< "add of  next header " <<pcurrent->m_next<<endl;
		 while (pcurrent->m_next!=NULL)
			
			 pcurrent=pcurrent->m_next;
		 mynode<T1>* pNewNode=new mynode<T1>;
		 pcurrent->m_next=pNewNode;
		 pNewNode->m_next=0;
		 pNewNode->m_obj=val;
	 }
 }
  template<typename T,typename T1> void myList<T,T1>::printflist()
 {
	 if (m_header!=NULL)
	 {
		 mynode<T1>* pcurrent=m_header;
		 while (pcurrent->m_next)
			{ 
				cout<<pcurrent->m_obj <<endl;
				pcurrent=pcurrent->m_next;
		    }
	 }

 }
 int main()
 {

	 myList<int,int > mylist1;
	 mylist1.create(0);
	 	// mylist1.addtotail(1);
	 for (int k=0;k<12;k++)
	 {
		 mylist1.addtotail(k);
	 }
	 mylist1.printflist();
	 int gfl;
	 cin>>gfl;
 }


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值