1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
|
/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } };*/ class Solution { public: ListNode* ReverseList(ListNode* head) { if(head==NULL) return NULL; ListNode *p,*q,*t; p=NULL; q=head; t=head->next; while(q!=NULL){ q->next=p; p=q; q=t; t=t->next; } return p; } };
|
近期评论