Leetcode 92.反转链表II
题目难度:中等
1. 思路:
- 题目给定left 和right,要求这中间的要反转;
- 头插法实现;
- 直接上图;
- 一开始还想了一个count计数,发现多余了;
- 设置一个p指针指向left位置的前一个节点,r指向left,q指向r->next;
- 接下来就是头插法的经典步骤啦,图片中写出来啦‘;
- 解释:q指向r->next;r->next指向q->next;这就实现q节点和r节点后一个节点连接,这样把q节点插过去的时候就不会断链,然后实现头插;
- q->next指向p->next也就是要反转啦,这个时候可能p的后面已经有很多节点而不是正好是r;
- p->next再指向q这就把q节点插入到p的后面啦;
- 下面再给出反转过程的图解;
- 最后给出代码;
# 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, left, right):
"""
:type head: ListNode
:type left: int
:type right: int
:rtype: ListNode
"""
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def reverseBetween(self, head, left, right):
#创建一个"头节点"
node = ListNode(-1)
#指向头指针
node.next = head
p = node
for _ in range(left - 1):
p = p.next
r = p.next
for _ in range(right - left):
q = r.next
r.next = q.next
q.next = p.next
p.next = q
return node.next