leetcode 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
  题意：给定一个单链表和一个数值，将单链表中以该数值个节点为一组进行翻转（不可以只交换节点值）

/**
 * 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) {
        if (head == nullptr || k == 1) return head;
        int num = 0;
        ListNode *preheader = new ListNode(-1);
        preheader->next = head;
        ListNode *cur = preheader, *nex, *pre = preheader;
        while (cur = cur->next) num++; //链表长度
        while (num >= k) {
            cur = pre->next;
            nex = cur->next;
            for (int i = 1; i < k; ++i) {
                cur->next = nex->next;
                nex->next = pre->next;
                pre->next = nex;
                nex = cur->next;
            }//翻转即每次从cur指向的节点后面取一个节点放到pre后面，pre指向第一个需要翻转节点之前的节点
            pre = cur;
            num -= k;
        }
        return preheader->next;
    }
};