25. k个一组翻转链表 (Reverse Nodes in k-Group)

题目描述

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.

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: [3,2,1,4,5]

Example 3:

Input: head = [1,2,3,4,5], k = 1
Output: [1,2,3,4,5]

Example 4:

Input: head = [1], k = 1
Output: [1]

Constraints:

• The number of nodes in the list is in the range sz.
• 1 <= sz <= 5000
• 0 <= Node.val <= 1000
• 1 <= k <= sz

Follow-up: Can you solve the problem in O(1) extra memory space?

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/reverse-nodes-in-k-group
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解题方法

方法一：迭代+递归

/**
 * 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 {
private:
	ListNode* reverse(ListNode* head, ListNode* successor) {
		ListNode* pre = nullptr;
		ListNode* cur = head;
		ListNode* next;
		while(cur != successor) {
			next = cur->next;
			cur->next = pre;
			pre = cur;
			cur = next;
		}
		return pre;
	}
public:
	ListNode* reverseKGroup(ListNode* head, int k) {
		ListNode* leftNode = head;
		ListNode* rightNode = head;
		for(int i = 0; i < k; i++) {
			if(!rightNode) return head;
			rightNode = rightNode->next;
		}
		ListNode* newHead = reverse(leftNode, rightNode);
		leftNode->next = reverseKGroup(rightNode, k);
		return newHead;
	}
};

• 时间复杂度 O(N)。N为链表总节点数。
• 空间复杂度 O(N)。由于使用递归，将会使用隐式栈空间。递归深度可能会达到（N / k）层。k为常数。

方法二：迭代法

/**
 * 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 {
private:
	ListNode* reverse(ListNode* head, ListNode* successor) {
		ListNode* pre = nullptr;
		ListNode* cur = head;
		ListNode* next;
		while(cur != successor) {
			next = cur->next;
			cur->next = pre;
			pre = cur;
			cur = next;
		}
		return pre;
public:
	ListNode* reverseKGroup(ListNode* head, int k) {
		ListNode* dummyNode(-1, head);
		ListNode* pre = dummyNode;
		ListNode* rightNode;
		while(head) {
			rightNode = head;
			for(int i = 0; i < k; i++) {
				if(!rightNode) return dummyNode->next;
				rightNode = rightNode->next;
			}
			pre->next = reverse(head, rightNode);
			head->next = rightNode;
			pre = head;
			head = rightNode;
		}
		return dummyNode->next;
	}
};

• 时间复杂度 O(N)。
• 空间复杂度 O(1)。只用到常数个变量。