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