题目描述:
给你一个链表,每 k 个节点一组进行翻转,请你返回翻转后的链表。
k 是一个正整数,它的值小于或等于链表的长度。
如果节点总数不是 k 的整数倍,那么请将最后剩余的节点保持原有顺序。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/reverse-nodes-in-k-group
解题思路及代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reverseN__(self, head, n):
if n == 1:
return head
tail = head.next
p = self.reverseN__(head.next, n - 1)
head.next = tail.next
tail.next = head
return p
def reverseN(self, head, n):
p = head
cnt = n
while p and n > 1:
p = p.next
n -= 1
if p == None:
return head
return self.reverseN__(head, cnt)
def reverseKGroup(self, head, k):
"""
:type head: ListNode
:type k: int
:rtype: ListNode
"""
ret = ListNode(0, head)
p = ret
q = p.next
while (1):
p.next = self.reverseN(q, k)
if p.next == q:
break
p = q
q = p.next
return ret.next
运行结果: