题目:25. Reverse Nodes in k-Group k个一组翻转链表
难度:困难
Given a linked list, reverse the nodes of a linked list k at a time and return its 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.
Example:
Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5
Note:
- Only constant extra memory is allowed.
- You may not alter the values in the list's nodes, only nodes itself may be changed.
题意解析:
给出一个链表,每 k 个节点一组进行翻转,并返回翻转后的链表。
k 是一个正整数,它的值小于或等于链表的长度。如果节点总数不是 k 的整数倍,那么将最后剩余节点保持原有顺序。
示例 :
给定这个链表:1->2->3->4->5
当 k = 2 时,应当返回: 2->1->4->3->5
当 k = 3 时,应当返回: 3->2->1->4->5
说明 :
- 你的算法只能使用常数的额外空间。
- 你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
解题思路一:
首先获取链表的长度和k的值比较,如果长度小于k,那么就直接返回当前链表,如果长度大于等于k的话,就将链表的第一个节点一直到第k个节点这之间的所有节点进行反转,反转之后得到一个新的反转链表(比如链表为1->2->3->4->5->6->7,k=3
),那么经过一次反转之后得到的新的反转链表为3->2->1,此时的head节点指向4,我们只需让新的节点的最后一个节点指向由链表4->5->6->7经过同样的操作所返回的节点即可。
public ListNode reverseKGroup(ListNode head, int k) {
int count = 0;
int k1 = k;
ListNode node1 = null;
ListNode node2 = head;
while (node2 != null){
count++;
node2 = node2.next;
}
if(count < k){
return head;
}else {
while (head != null && k1-->0){
ListNode temp = head.next;
head.next = node1;
node1 = head;
head = temp;
}
}
ListNode node3 = node1;
while (node3.next!=null){
node3 = node3.next;
}
node3.next = reverseKGroup(head, k);
return node1;
}
提交代码之后:
Runtime: 0 ms, faster than 100.00% of Java online submissions for Reverse Nodes in k-Group.
Memory Usage: 35.4 MB, less than 99.95% of Java online submissions for Reverse Nodes in k-Group.