leetcode-92-反转链表②

题目描述: 方法一: class Solution: def reverseBetween(self, head: ListNode, m: int, n: int) -> ListNode: dummy = ListNode(0) dummy.next = head pre = dummy for i in range(m-
相关文章
相关标签/搜索