/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head){
if(head==NULL||head->next==NULL) return head;
struct ListNode *p,*q,*pre;
p=head;
q=head->next;
if(q->next==NULL) p->next=NULL;
while(q->next!=NULL){
pre=q->next;
q->next=p;
if(p==head) p->next=NULL;
p=q;
q=pre;
}
q->next=p;
return q;
}