单链表的递归反转
class Solution {
public:
ListNode* reverseList(ListNode* head) {
//递归反转链表
if(head==NULL||head->next==NULL) return head;
ListNode *newHead=reverseList(head->next);
head->next->next=head;
head->next=NULL;
return newHead;
}
};