Leetcode 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 ofk 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

解决方法：

- 首先需要求出链表的长度，只有长度满足时，才能进行反转。

- 新建一个辅助头指针，这样可以很方便返回结果，不需要复杂的判断。

- 反转的时候注意指针赋值的顺序，不要乱了。

代码：

ListNode* reverseKGroup(ListNode* head, int k) {
        int len = 0;  
        ListNode* cur = head;
        while(cur){
            ++len;
            cur = cur->next;
        }
        
        if (!head || k < 2 || k > len)
            return head;
        
        ListNode preheader = ListNode(INT_MIN);
        preheader.next = head;
        ListNode* prev =&preheader;
        while(k <= len){
            ListNode* cur = prev->next;
            ListNode* next = cur->next;
            for(int i = 1; i < k; i++){
                // 将第一个节点指向下下一个节点
                cur->next = next->next;
                // 将要移动的节点移到前面
                next->next = prev->next;
                // 更新这个节点为当前反正链表的第一个节点
                prev->next = next;
                // 下一个节点指向下个需要操作的节点
                next = cur->next;
            }
            // 更新已经反转的链表尾指针
            prev = cur;            
            len -= k;
        }
        
        return preheader.next;
    }