# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param head ListNode类 # @param m int整型 # @param n int整型 # @return ListNode类 # class Solution: def reverseBetween(self , head: ListNode, m: int, n: int) -> ListNode: # write code here dummy = ListNode(0) dummy.next = head pre = dummy for _ in range(m-1): pre = pre.next cur = pre.next for _ in range(n-m): nxt = cur.next cur.next = nxt.next nxt.next = pre.next pre.next = nxt return dummy.next
反转链表的变形