C++单链表反转

单链表反转笔记：

 #include<iostream>
 #include<string.h>
 using namespace std;

 struct ListNode
 {
     int val;
     ListNode* next;
     ListNode(int i):val(i),next(NULL){};
 };
 void printList(ListNode* myList)
 {
     while(myList != NULL)
     {
         cout << myList -> val << "->";
         myList = myList -> next;
     }
     cout << "NULL" << endl;
 }
 ListNode* reverseList(ListNode* pHead)
 {

     if(pHead == NULL) return pHead;
     ListNode* pre = NULL;
     ListNode* cur = pHead;
     while(cur != NULL)
     {
        ListNode* newpre = cur;
        ListNode* newcur = cur -> next;
        cur -> next = pre;
        cur = newcur;
        pre = newpre;
     }
     return pre;
 }
 int main()
 {
     ListNode* pHead =  new ListNode();
     ListNode* cur = pHead;
     for (int i = ; i < ; ++i)
     {
         ListNode* newNode = new ListNode(i);
         cur -> next = newNode;
         cur = cur -> next;
     }
     printList(pHead);
     printList(reverseList(pHead));
     return ;
 }