剑指offer（十五）:反转链表

class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
        ListNode * linkList = new ListNode(0);
        
        ListNode * p = pHead;
        ListNode * nextP = p->next;
        
        while(p){
            p->next = linkList->next;
            linkList->next = p;
            p = nextP;
            nextP = nextP->next;
        }
        
        return linkList->next;
    }
};