反转链表

#include <stdio.h> #include <stdlib.h> #include <string.h> struct Node{ int p_val; Node* p_next; }; Node* ReverseList(Node* pHead){ if(pHead == NULL) return;//空指针 if(pHead->p_next == NULl) return pHead;//如果只有一个节点 Node* pNode = pHead; Node* pReverseHead = NULL; Node* pPrev = NULL; while(pNode != NULL){ Node* pNext = pNode->p_next;//tmp指针指向当前的节点的下一个节点 if(pNext == NULL) pReverseHead = pNode; pNode->p_next=pPrev; pPrev = pNode; pNode = pNext; } return pReverseHead; }