/
* 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 q, p;
p = NULL;
while(head != NULL)
{
q = head;
head = head->next;
q->next = p;
p = q;
}
return p;
}
};