链表问题的递归写法
Leetcode-206. 反转链表给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def reverseList(self, head: Lis



