//鏈表類CLinkList的實(shí)現(xiàn)
#include "LinkList.h"
#include <iostream >
using namespace std;

CLinkList::CLinkList(int n)	// 構(gòu)建有n個(gè)結(jié)點(diǎn)的單向鏈表
{
	CNode	*p;					//生成鏈表時(shí)。零時(shí)定一的結(jié)點(diǎn)
	m_nodeNum = n;
	pFirst = NULL; 
	pTail = pFirst;

	cout<<"輸入鏈表中的 "<<n <<" 個(gè)結(jié)點(diǎn)的數(shù)據(jù)[整數(shù)][23 43 45 ...]:\n";
	for(int i=1; i<=n; i++)		//用于設(shè)置鏈表中結(jié)點(diǎn)的數(shù)據(jù)
	{
		p = new CNode;
		cin>>p->data;
		if( !pFirst )			//當(dāng)鏈表為空，讓頭、尾指針指向第一個(gè)結(jié)點(diǎn)
		{
			pFirst = p;
			pTail = pFirst;
		}
		pTail->next = p;		//當(dāng)鏈表不空，在尾結(jié)點(diǎn)后鏈結(jié)新結(jié)點(diǎn)
		pTail = pTail->next;
	}
	pTail->next=NULL;			//鏈表的最后一個(gè)結(jié)點(diǎn)的next域?yàn)镹ULL
	//最有pTail指向鏈表的最后一個(gè)結(jié)點(diǎn)指針在最后一個(gè)位置
}

CLinkList::~CLinkList()  
{
	CNode *p = pFirst;
	while(p)
	{
		pFirst = p->next;
		delete p;				//釋放鏈表中結(jié)點(diǎn)所占用的空間
		p=pFirst;
	}
}

void CLinkList::Print()		//輸出鏈表信息
{
	CNode *p = pFirst;
	cout<<"鏈表中的結(jié)點(diǎn)數(shù)據(jù)為：\n";
	while( p )
	{
		cout<<p->data<<"   ";
		p = p->next;
	}
	cout<<endl;
}