Reverse Nodes in k-Group 每隔k翻转链表

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.

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

Note:

Only constant extra memory is allowed.
You may not alter the values in the list's nodes, only nodes itself may be changed.

题意：每k个元素翻转链表，最后不满则不翻转。
解法一：三个指针，和逆置链表同样的道理，每操作一次，将指针们移到下一次的标准位置。

/**
 * 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 == NULL || k == 1) return head;
        
        ListNode dummy(-1);
        dummy.next = head;
        ListNode *prehead = &dummy;
        ListNode *tmp = prehead, *pre = prehead, *cur;
        int len = 0;
        while(pre = pre->next) len++;
        
        while(len >= k){
            pre = tmp->next;
            cur = pre->next;
            for(int i = 1; i < k; ++i){
                pre->next = cur->next;
                cur->next= tmp->next;
                tmp->next = cur;
                cur = pre->next;
            }
            tmp = pre;
            len -= k;
        }
        return dummy.next;
    }
};

解法二：讨论区更快的写法。

class Solution {
    ListNode * reversePart(ListNode* head, ListNode* last) {
        auto next = last;
        while (head != last) {
            auto tmp = head->next;
            head->next = next;
            next = head;
            head = tmp;
        }
        return next;
    }
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        if (k <= 1)
            return head;
        ListNode *result = nullptr;
        ListNode *last = nullptr;
        while (head != nullptr) {
            auto newHead = head;
            for (int i = 0 ; i < k-1 && newHead != nullptr; ++i)
                newHead = newHead->next;
            if (newHead == nullptr)
                break;
            
            auto next = newHead->next;
            auto tmp = reversePart(head, next);
            if (last != nullptr)
                last->next = tmp;
            if (result == nullptr)
                result = tmp;
            
            last = head;
            head = next;
        }
        return result != nullptr ? result : head;
    }
};