025 Reverse Nodes in k-Group [Leetcode]

题目内容：

Given a linked list, reverse the nodes of a linked list k at a time and return its modified 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 nodes, only nodes itself may be changed.

Only constant memory is allowed.

For 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

解题思路：
同上一题，将k个摘下来，反转链表，再循环处理。
反转链表的花式玩法：
1. 将节点依次摘下，然后将后摘下的节点的next指向刚才摘下的节点
2. 使用栈将节点依次存储，再连起来（需要O(n)的空间）
3. 使用递归
4. 使用三个指针，一个指针指向翻转的链表的起始节点，一个指针指向当前要处理的节点，另一个指针指向未处理的链表头。

代码(反转链表使用了方法1)：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverseKGroup(ListNode *head, int k) {
        ListNode *start(head), *end(head), *pre_end(NULL);
        for (int i = 1; i < k && end != NULL; ++i)
            end = end->next;
        if (end == NULL)
            return head;

        head = end;
        while (end != NULL) {
            reverseList(start, end);
            // pre_end 记录上一次反转链表的结尾，需指向下一次翻转后的开头
            if(pre_end != NULL)
                pre_end->next = end;
            end = start->next;
            start->next = NULL;
            pre_end = start;
            start = end;
            for (int i = 1; i < k && end != NULL; ++i)
                end = end->next;
        }
        if(pre_end != NULL)
                pre_end->next = start;

        return head;
    }

    void reverseList(ListNode *start, ListNode *end) {
        ListNode *end_mark(end->next), *curr(start->next), *temp;
        start->next = end_mark;
        while(curr != end_mark) {
            temp = curr;
            curr = curr->next;
            temp->next = start;
            start = temp;
        }
    }
};