bool List::ListInsert(int i, Node *pNode)

{

if (i<0 || i>m_iLength)

{

return false;

}

Node *currentNode = m_pList;

for (int k = 0; k < i; k++)

{

currentNode = currentNode->next;

}

Node *newNode = new Node;

if (newNode == NULL)

{

return false;

}

newNode->data = pNode->data;

newNode->next = currentNode->next;

currentNode->next = newNode;

}

链表的实现， 为什么要在堆中申请一个newNode 直接连接不就行了