类定义链表

#include <iostream>
#include <string>
using namespace std;

class CList
{
protected:
	struct Node
	{
		int id;
		Node *pNext;
	};
	Node *pHead;
	Node *pEnd;
	int m_nsize;
public:
	CList()
	{
		pHead = 0;
		pEnd = 0;
		m_nsize = 0;
	}
	~CList()
	{
		Node *del = new Node;
		del = 0;
		while(pHead != 0)
		{
			del = pHead;
			pHead = pHead ->pNext;
			delete del;
			del = 0;
		}
	}
public:
	void Display()
	{
		Node *pMark = pHead;
		while(pMark != 0)
		{
			cout << pMark ->id << endl;
			pMark = pMark ->pNext;
		}
		cout << "size:" << m_nsize << endl;
	}
	void Addnode(int n)
	{
		//  创建一个节点
		Node *ptemp = new Node;
		ptemp ->id = n;
		ptemp ->pNext = 0;
		//  放到链表的尾部
		if(pHead == 0)
		{
			pHead = ptemp;
			pEnd = ptemp;
		}
		else
		{
			pEnd ->pNext = ptemp;
			pEnd = ptemp;
		}
		//  长度 +1
		m_nsize ++;
	}
	void