反转链表

Struct ListNode

{

         int  m_nKey;

         ListNode*  m_pNext;

};

ListNode* ReverseList(ListNode* pHead)
{
ListNode* pReversedHead = NULL;
ListNode* pNode = pHead;
ListNode* pPrev = NULL;
while (pNode != NULL)
{
ListNode* pNext = pNode->m_pNext;
if (pNext == NULL)
    pReversedHead = pNode;
pNode->m_pNext = pPrev;
pPrev = pNode;
pNode = pNext;
}
return pReversedHead;
}

提前想好测试用例测试代码：

反转链表

原文：http://blog.csdn.net/wangfengfan1/article/details/46805235