LeetCode 筆記 - 92. Reverse Linked List II

# 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: Optional[ListNode], left: int, right: int) -> Optional[ListNode]:
        
        data = []
        
        cur_node = head
        while cur_node:
            data.append(cur_node)
            cur_node = cur_node.next
            
        data = data[:left - 1] + list(reversed(data[left - 1: right])) + data[right:]
        
        for i in range(len(data) - 1):
            data[i].next = data[i + 1]
        data[-1].next = None

        return data[0]