25. 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 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个节点一组反转链表，返回修改后的链表。
k为正数且小于等于链表的长度。若节点数不是k的整数倍，则末尾的节点保持不变。
可以修改节点，不可修改节点的值。
算法空间复杂度要求O(1)。

方法一：
首先遍历整个链表，统计出链表的长度，然后如果长度大于等于k，我们开始交换节点

ListNode* ReverseNodesInKGroup::reverseKGroup1(ListNode* head, int k)
{
    ListNode *dummy = new ListNode(-1), *pre = dummy, *cur = pre;
    dummy->next = head;
    int num = 0;
    //计算链表长度
    while (cur = cur->next) ++num;
    while (num >= k)
    {
        cur = pre->next;
        //反转链表，例如：1->2->3经过两次变化2->1->3，3->2->1实现反转
        for (int i = 1; i < k; ++i) {
            ListNode *t = cur->next;
            cur->next = t->next;
            t->next = pre->next;
            pre->next = t;
        }
        pre = cur;
        num -= k;
    }
}

方法二：
两个函数分别实现分段和反转。

ListNode* ReverseNodesInKGroup::reverseKGroup2(ListNode* head, int k)
{
    if (!head || k == 1) return head;

    ListNode *dummy = new ListNode(-1);
    dummy->next = head;

    ListNode *pre = dummy, *cur = dummy->next;

    int i = 0;
    while (cur)
    {
        ++i;
        if (i % k == 0) {
            pre = reverseOneGroup(pre, cur->next);
            cur = pre->next;
        }
        else {
            cur = cur->next;
        }
    }
    return dummy->next;
}

ListNode *ReverseNodesInKGroup::reverseOneGroup(ListNode *pre, ListNode *next)
{
    ListNode *last = pre->next;
    ListNode *cur = last->next;
    while (cur != next) {
        last->next = cur->next;
        cur->next = pre->next;
        pre->next = cur;
        cur = last->next;
    }
    return last;
}