解题思路:
- 先抄后看,养成习惯
- 初始链表不体面,我们就帮他体面(设置头结点res)
- 看一下链表的总长度是多少 - i用来记录
- 链表三兄弟 - pre 、 q 、 r(前中后三个结点)
- 建议对着for循环里面的内容画一遍图,循环两次观察一下过程
- 心得体会:翻转链表可以考虑头插法来实现
给一个错误的代码,错就错在r.next = q,这一句让我半天想不明白,后来发现想要循环更新,不能让r.next = q,应该用 r.next = pre.next – 两个结点互换位置等于q没有问题,但是我们要实现头插法,就不能用q,所以细节决定成败
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类
# @param k int整型
# @return ListNode类
#
class Solution:
def reverseKGroup(self , head: ListNode, k: int) -> ListNode:
# write code here
res = ListNode(0)
res.next = head
p = head
i = 0
while p:
i += 1
p = p.next
print(i)
pre = res
q = head
while head and i >= k:
for j in range(k-1):
r = q.next
q.next = r.next
r.next = q
pre.next = r
i -= k
pre = q
q = pre.next
return res.next
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类
# @param k int整型
# @return ListNode类
#
class Solution:
def reverseKGroup(self , head: ListNode, k: int) -> ListNode:
# write code here
res = ListNode(0)
res.next = head
p = head
i = 0
while p:
i += 1
p = p.next
print(i)
pre = res
q = head
while head and i >= k:
for j in range(k-1):
r = q.next
q.next = r.next
r.next = pre.next
pre.next = r
i -= k
pre = q
q = pre.next
return res.next