ListNode* Reverse(ListNode* pHead)
{
ListNode* pNewHead = NULL;
ListNode* pPre = NULL;
ListNode* pCur = pHead;
while(pCur != NULL)
{
ListNode* pNext = pCur->Next;
//這裡一定要判斷pNext是否為空
if(pNext == NULL)
pNewHead = pCur;
pCur->Next = pPre;
pPre = pCur;
pCur = pNext;
}
return pNewHead;
}