给你链表的头节点 head ,每 k 个节点一组进行翻转,请你返回修改后的链表。
k 是一个正整数,它的值小于或等于链表的长度。如果节点总数不是 k 的整数倍,那么请将最后剩余的节点保持原有顺序。
你不能只是单纯的改变节点内部的值,而是需要实际进行节点交换。
示例 1:
输入:head = [1,2,3,4,5], k = 2
输出:[2,1,4,3,5]
示例 2:
输入:head = [1,2,3,4,5], k = 3
输出:[3,2,1,4,5]
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/reverse-nodes-in-k-group
思路:
如何 K 个一组反转链表 :: labuladong的算法小抄
c++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
// [a, b)
ListNode* reverseListNodes(ListNode* a, ListNode* b) {
ListNode* pre = nullptr;
ListNode* currNode = a;
ListNode* nxtNode = a;
while(currNode != b) {
nxtNode = currNode->next;
currNode->next = pre;
pre = currNode;
currNode = nxtNode;
}
return pre;
}
ListNode* reverseKGroup(ListNode* head, int k) {
ListNode* left = head;
ListNode* right = head;
int count = 0;
while(count<k) {
// 剩余链表长度不足 k 时,直接把剩余链表的头部返回
if(right == nullptr) {
return head;
}
right = right->next;
count++;
}
ListNode* newHead = reverseListNodes(left,right);
ListNode* lastNode= reverseKGroup(right,k);
left->next = lastNode;
return newHead;
}
};
java:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
// [left, right)
public ListNode reverseListNodes(ListNode left, ListNode right) {
ListNode first = left;
ListNode second = left.next;
while(second != right) {
ListNode tmp = first;
first = second;
second = second.next;
first.next = tmp;
}
return first;
}
public ListNode reverseKGroup(ListNode head, int k) {
ListNode left = head;
ListNode right = head;
int count = 0;
while(right != null) {
count++;
right = right.next;
if(count == k) {
break;
}
}
// 最后剩余的节点保持原有顺序
if(count < k) {
return left;
}
ListNode newHead = reverseListNodes(left, right);
ListNode lastNode = reverseKGroup(right, k);
left.next = lastNode;
return newHead;
}
}