给定一个链表，按每k个节点一组反转链表，若剩余不足k个节点则保持原顺序。可以使用递归或迭代法解题，递归法中先判断节点数是否大于等于k，然后反转前k个节点，并对剩余链表递归处理。
Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.
You may not alter the values in the list's nodes, only nodes themselves may be changed.
Example 1:
Input: head = [1,2,3,4,5], k = 2 Output: [2,1,4,3,5]
Example 2:
Input: head = [1,2,3,4,5], k = 3 Output:
最低0.47元/天 解锁文章
363
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
