这道题是第206题的升级版,与206题不同的是,这道题限制了反转的范围。
206题的代码如下:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
if head is None or head.next is None:
return head
prev = None
p = head
while p is not None:
p1 = p.next
p.next = prev
prev = p
p = p1
return prev
本题的代码主要根据以上代码进行更改,由于p在反转完后,指向的是反转位置的下一个位置,所以在92题中不能通过None来判断是否反转完毕。在92题中,我采用的是标记次数,进行(n-m+1)次操作,即可全部反转。在206题中,直接返回prev即可,因为prev即是新的链表头,然而由于本题是部分翻转,所以不能返回prev,而是将prev连在原链表中。我采用的方式是记录了第(n-1)个结点,将prev连在(n-1)结点后面即可。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reverseBetween(self, head: ListNode, m: int, n: int) -> ListNode:
if head is None or m == n:
return head
he = ListNode(0)
he.next = head
p1, prev, pnow = he, head, head
for i in range(n):
prev = prev.next
if i < m-1:
pnow = pnow.next
p1 = p1.next
for i in range(n-m+1):
pnext = pnow.next
pnow.next = prev
prev = pnow
pnow = pnext
p1.next = prev
return he.next