【leetcode每日刷题】92. Reverse Linked List II

Reverse a linked list from position m to n. Do it in one-pass.

Note: 1 ≤ m ≤ n ≤ length of list.

Example:

Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL

使用指针记录四个边界的位置，使用pre记录当前指针的前指针，用于反转m和n之间的结点，找到第n+1个节点后停止循环，然后将两个两边连接起来，要考虑到是否从1进行反转这种情况

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def reverseBetween(self, head, m, n):
        """
        :type head: ListNode
        :type m: int
        :type n: int
        :rtype: ListNode
        """
        Mleft, Nright = None, None
        index = 1
        pre = head
        current = head
        while current:
            next = current.next
            if index >= m and index <= n:
                current.next = pre
            if index == m-1:
                Mleft = current
            if index == m:
                M = current
            if index == n:
                N = current
            if index == n+1:
                Nright = current
                break
            pre = current
            current = next
            index += 1
        if Mleft is not None:  # 不是从1开始进行反转
            Mleft.next = N
        if M is not None:
            M.next = Nright
        if Mleft is None:  # 从1开始反转
            return N
        else:
            return head