反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4
输出: 1->4->3->2->5->NULL
链接: https://leetcode.com/problems/reverse-linked-list-ii/
解题思路:
首先找到要反转的链表的起始位置(即m位置),然后采用头插法将m~n之间的结点反转即可。创建头结点使得原链表的起始结点的处理方式与中间结点相同。
我的代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def reverseBetween(self, head, m, n):
"""
:type head: ListNode
:type m: int
:type n: int
:rtype: ListNode
"""
# 头插法
if m == n:
return head
node = ListNode(-1)
node.next = head
head = node
p = head
i = 1
while i < m:
p = p.next
i += 1
prem = p
hm = p.next
p = hm.next
while i < n:
temp = p.next
p.next = prem.next
prem.next = p
p = temp
hm.next = p
i += 1
return head.next
Time: O(N)
Space: O(1)