逆置单链表

//没有头结点typedef int DataType;    //类型定义typedef struct node{     //单链表定义DataType data;    struct node *next;}LinkedNode, *LinkList;void ReverseList(LinkList &ListHead){if( (NULL == ListHead) || (NULL == ListHead -> next) ){        return ;         //边界检测}LinkedNode *pPre = ListHead;      //先前指针LinkedNode *pCur = pPre -> next;  //当前指针LinkedNode *pNext = NULL;         //后继指针while(pCur != NULL){pNext = pCur -> next;pCur -> next = pPre;pPre = pCur;pCur = pNext;}ListHead -> next = NULL;ListHead = pPre;}