/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
ListNode *list = NULL;
ListNode *pre = NULL;
ListNode *cur = pHead;
while(cur != NULL){
ListNode *next = cur->next;
if(next == NULL){
list = cur;
}
cur->next = pre;
pre = cur;
cur = next;
}
return list;
}
};