[LeetCode]206. Reverse Linked List

206. Reverse Linked List
Reverse a singly linked list.

---

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    ListNode* reverseList(ListNode* head) {        ListNode* pPre = NULL;        ListNode* pNext = NULL;        ListNode* pCur = head;        while(pCur){            pNext = pCur->next;            pCur->next = pPre;            pPre = pCur;            pCur = pNext;        }        return pPre;    }};