/**
* 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*pNode=head;
ListNode*pPre=NULL;
ListNode*res=head;
while(pNode!=NULL){
ListNode*pNext=pNode->next;
if(pNext==NULL){
res=pNode;
}
pNode->next=pPre;
pPre=pNode;
pNode=pNext;
}
return res;
}
};