实现

 1 Node *ReverseList(Node *pRoot)   2 {   3     Node *pEnd = pRoot, *pBeg = pRoot;   4     if (pRoot)   5     {   6         while (pEnd->pNext)   7         {   8             Node *pNode = pEnd->pNext;   9             pEnd->pNext = pNode->pNext;  10   11             pNode->pNext = pBeg;  12             pBeg = pNode;  13         }  14     }  15     return pBeg;  16 }