[LeetCode]92. 反转链表 II

92. 反转链表 II

难度中等

给你单链表的头指针 head 和两个整数 left 和 right ，其中 left <= right 。请你反转从位置 left 到位置 right 的链表节点，返回 反转后的链表 。

示例 1：

输入：head = [1,2,3,4,5], left = 2, right = 4
输出：[1,4,3,2,5]

示例 2：

输入：head = [5], left = 1, right = 1
输出：[5]

提示：

• 链表中节点数目为 n
• 1 <= n <= 500
• -500 <= Node.val <= 500
• 1 <= left <= right <= n

进阶： 你可以使用一趟扫描完成反转吗？

---

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseBetween(self, head: ListNode, left: int, right: int) -> ListNode:

        def reverse(head):
            pre = None
            while head:
                next = head.next
                head.next = pre
                pre = head
                head = next
            return pre
        List = leftNode = rightNode = ListNode()
        List.next = leftNode.next = rightNode.next = head
        while left > 1:
            leftNode = leftNode.next
            left -= 1
        while right > 0:
            rightNode = rightNode.next
            right -= 1
        leftTmp, rightTmp = leftNode.next, rightNode.next
        leftNode.next, rightNode.next = None, None
        leftNode.next= reverse(leftTmp)
        leftTmp.next = rightTmp
        return List.next