各位帮我看看,我从链表尾插入数据,怎么没有插入进去.

[Gengoo]

//插入结点到链表尾
int PNode::InsertEndNode(int value)
{
	CNode *curNode = NULL;
	CNode *tailNode = new CNode;
	tailNode->nNode = value;

	if (pHeadNode == NULL)
	{
		pHeadNode = new CNode;
		pHeadNode = tailNode;
		pHeadNode->pNext = NULL;
	}
	else
	{
		curNode = pHeadNode;
		while (curNode)
		{
			curNode = curNode->pNext;
		}

		tailNode->pNext = curNode;
		curNode = tailNode;		
	}
	return 0;
}

[Inhibitory]

pHeadNode = new CNode;
pHeadNode = tailNode; // 最起码这里都错了, 再仔细改改

[effective_person]

//插入结点到链表尾
int PNode::InsertEndNode(int value)
{
    CNode *curNode = NULL;
    CNode *tailNode = new CNode;
    tailNode->nNode = value;

    if (pHeadNode == NULL)
    {
        pHeadNode = new CNode;
        pHeadNode = tailNode;
        pHeadNode->pNext = NULL;
    }
    else
    {
        curNode = pHeadNode;
        while (curNode)
        {
            curNode = curNode->pNext;
        }

        curNOde->pNext = tailNode;//这里写错了吧！
        curNode = tailNode; 
        curNode->next=NULL;       
    }  
    return 0;
}

[Gengoo]

非常感谢2位的解答,我已经解决了

int PNode::InsertEndNode(int value)
{
	CNode *curNode;
	CNode *tailNode = new CNode;
	tailNode->nNode = value;

	//判断原链表是否为空
	if (pHeadNode == NULL)
	{
		pHeadNode = new CNode;
		pHeadNode = tailNode;
		pHeadNode->pNext = NULL;
	}
	else
	{
		curNode = pHeadNode;

		//当当前的下一个结点为空时,说明已经找到最后一个非NULL结点
		while (curNode->pNext)
		{
			curNode = curNode->pNext;
		}

		curNode->pNext = tailNode;
		tailNode->pNext = NULL;	
	}
	return 0;
}

[OenAuth.Core]

int PNode::InsertEndNode(int value)
{
CNode *curNode = NULL;
CNode *tailNode = new CNode;
tailNode->nNode = value;
tailNode->next=NULL;//这个别忘，不然指针就悬空了

if (pHeadNode == NULL)
{
pHeadNode = new CNode;//这句最好不要，应该在你类的构造函数中写。不然和上面的if就矛盾了
pHeadNode = tailNode;
}
else
{
curNode = pHeadNode;
while (curNode->next)//这点最重要了，如果用curNode作为判断语句，后果是不可知的
{
curNode = curNode->pNext;
}

curNOde->pNext = tailNode;//要这一句就够了，后面多余
}
return 0;
}


//---------------------------------------------------------------------------------------------
你这样写的话，建的是无头结点链表，建议不采用，应建一个有头结点的，只要改一点就可以了。
一、先在构造函数中建一个头结点：
pHeadNode = new CNode;
pHeadNote->nNode=0;
pHeadNode->next=NULL;

二、 if (pHeadNode->next == NULL)
{
pHeadNode->next = tailNode;
}
三、curNode = pHeadNode->next;