链表反转的递归实现 - LeetCode - 206. reverseList Linked List (Easy)
206. reverseList Linked List (Easy)Given the head of a singly linked list, reverseList the list, and return the reverseListd list.链表反转可以通过头插法实现,较为简单,此处仅讨论其递归实现。/* Definition for singly-linked list. */public class ListNode { int val; ListNode ne



