剑指offer 面试题16中 pPrev不应赋为pHead，pReversedHead可以

剑指offer  面试题16代码如下：

// ReverseList.cpp : Defines the entry point for the console application.
//

// 《剑指Offer——名企面试官精讲典型编程题》代码
// 著作权所有者：何海涛

#include "stdafx.h"
#include "..\Utilities\List.h"

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;
}

// ====================测试代码====================
ListNode* Test(ListNode* pHead)
{
    printf("The original list is: \n");
    PrintList(pHead);

    ListNode* pReversedHead = ReverseList(pHead);

    printf("The reversed list is: \n");
    PrintList(pReversedHead);

    return pReversedHead;
}

// 输入的链表有多个结点
void Test1()
{
    ListNode* pNode1 = CreateListNode(1);
    ListNode* pNode2 = CreateListNode(2);
    ListNode* pNode3 = CreateListNode(3);
    ListNode* pNode4 = CreateListNode(4);
    ListNode* pNode5 = CreateListNode(5);

    ConnectListNodes(pNode1, pNode2);
    ConnectListNodes(pNode2, pNode3);
    ConnectListNodes(pNode3, pNode4);
    ConnectListNodes(pNode4, pNode5);

    ListNode* pReversedHead = Test(pNode1);

    DestroyList(pReversedHead);
}

// 输入的链表只有一个结点
void Test2()
{
    ListNode* pNode1 = CreateListNode(1);

    ListNode* pReversedHead = Test(pNode1);

    DestroyList(pReversedHead);
}

// 输入空链表
void Test3()
{
    Test(NULL);
}

int _tmain(int argc, _TCHAR* argv[])
{
    Test1();
    Test2();
    Test3();

    return 0;
}

在函数

ListNode* ReverseList(ListNode* pHead)<span style="font-family: Arial;">中，</span>

<span style="font-family: Arial;">开始初始化时：</span>

<span style="font-family: Arial;">pReversedHead可以</span><span style="font-family: Arial;">赋为pHead，因为下面会将最后的赋给它，另外即使仅有一个结点时，反转过来正好是这一个元素，符合逻辑；</span>

<span style="font-family: Arial;"></span><pre name="code" class="cpp" style="color: rgb(51, 51, 51); font-size: 14px; line-height: 26px;"><span style="font-family: Arial;">但pPrev不应赋为pHead，</span>

<span style="font-family: Arial;">因为赋为</span><span style="font-family: Arial;">pHead后，下面的</span>

<span style="font-family: Arial;"></span><pre name="code" class="cpp" style="color: rgb(51, 51, 51); font-size: 14px; line-height: 26px;">pNode->m_pNext = pPrev;
        pPrev = pNode;
        pNode = pNext;

这样的话pNode为pHead，他的下一个结点 pNode->m_pNext还是pHead
就相当于在第一个节点处一直循环打转了，不会再向下遍历，构成死循环

<span style="font-family: Arial;">如图：<img src="https://img-blog.csdn.net/20150428024556353?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQveHVlcnVpZmFu/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /></span>