指定区间还弄错…是序号,不是val.
class Solution:
def reverseBetween(self , head , m , n ):
# write code here
# 其实只是对应序号,其实第二个节点没有必要提前找出来~~
# 如果不细心,再多时间也无法解决~~所以有时候不浪费时间
# 这么简单的题做了那么久~~足见细心程度
# 链表操作先给他个头节点,避免出错~
def reverse(head1, res):
pre = head1
head1 = head1.next
num = 0
while num < res:
last = head1.next
head1.next = pre
pre = head1
head1 = last
num += 1
return pre, head1
first = ListNode(5)
first.next = head
head1 = head
pre_head1 = first
for i in range(2, m+1):
pre_head1 = pre_head1.next
head1 = head1.next
pre, res = reverse(head1, n-m)
pre_head1.next = pre
head1.next = res
return first.next