递归的方式反转链表

#include<iostream>


using namespace std;


struct ListNode{
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};


//206. Reverse Linked List


//递归的方式反转链表


class Solution{


public:
ListNode* reverseList(ListNode* head){
//递归终止条件
if (head == NULL || head->next == NULL)
return head;


ListNode* rhead = reverseList(head->next);
//head->next 此刻指向head后面的链表的尾节点
//head->next->next=head把head节点放在了尾部
head->next->next = head;
head ->next = NULL;


}
};


int main(){


return 0;
}