Reverse Linked List II Solutions in Python

Number 92

Difficulty Medium

Acceptance 38.9%

Solutions

Python solution by haoel/leetcode

def reverseBetween(self, head, m, n):
    if not head or n == m: return head
    p = dummy = ListNode(0)
    dummy.next = head
    for _ in range(m - 1):
        p = p.next
    tail = p.next
    
    for _ in range(n - m):
        temp = p.next
        p.next = tail.next
        tail.next = tail.next.next
        p.next.next = temp
    return dummy.next

def reverseBetween(self, head, m, n):
    if not head or n == m: return head
    p = dummy = ListNode(0)
    dummy.next = head
    for _ in range(m - 1):
        p = p.next
    tail = p.next
    
    for _ in range(n - m):
        temp = p.next
        p.next = tail.next
        tail.next = tail.next.next
        p.next.next = temp
    return dummy.next