https://leetcode-cn.com/problems/reverse-linked-list/
思路:递归
ListNode* dfs(ListNode* head, ListNode* res) {
if (head == NULL) {
return res;
}
ListNode* temp = head->next;
head->next = res;
res = head;
return dfs(temp, res);
}
ListNode* reverseList(ListNode* head) {
if (head == NULL || head->next == NULL) {
return head;
}
ListNode* res = new ListNode();
return dfs(head, res->next);
}