LeetCode刷题之路：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]

#最直观的思路

设定一个计数器，开始遍历即可。重点考察翻转链表的四部曲

# 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:
        if left == right:
            return head
        val = 1
        dummy = ListNode(-1)
        dummy.next = head
        node = dummy
        while node.next:
            if val == left:
                cur = node.next
                pre = ListNode(cur.val)
                cur = cur.next
                while val < right:
                    next1 = cur.next
                    cur.next = pre
                    pre = cur
                    cur = next1
                    val += 1
                node.next = pre
                while pre.next:
                    pre = pre.next
                pre.next = cur
                return dummy.next
            else:
                node = node.next
                val += 1