反转链表 II

class ListNode:
    def __init__(____):
        self.val = val
        self.next = next

def solve():
    def reverseBetween(____):
        if not head or left == right:
            return head
        dummy = ListNode(____, head)
        prev = dummy
        for _ in range(____):
            prev = prev.next
        curr = prev.next
        for _ in range(____):
            next_node = curr.next
            curr.next = next_node.next
            next_node.next = prev.next
            prev.next = next_node
        return dummy.next
    head = ListNode(____, ListNode(____, ListNode(____, ListNode(____, ListNode(____)))))
    result = reverseBetween(____)
    vals = []
    while result:
        vals.append(____)
        result = result.next
    print(____)