【数据结构之链表】25. Reverse Nodes in k-Group

25. Reverse Nodes in k-Group

Hard

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.

这道题！！做得我心好累T_T

本以为链表没问题了，可还是卡在了细节处，重点and细节：链表结点交换的指针控制！！谁先指向谁，后指向谁，顺序一定不能搞错！！！

先求出链表长度，再确定有几组，对每个组进行反转，一定要注意链表指针的指向！特别是交换时的顺序！！

/**
 * 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) return NULL;
        int len = 0;
        ListNode *l = head;
        while(l)
        {
            len++;
            l = l->next;
        }
        ListNode *hd = new ListNode(0);
        hd->next = head;
        ListNode *h = hd, *p = hd->next, *q = p->next;
        for(int i = 0; i < len / k; i++)
        {
            for(int j = 1; j < k; j++)
            {
                p->next = q->next;
                q->next = h->next;
                h->next = q;    
                q = p->next;
            }
            h = p;
            p = p->next;
            if(p) q = p->next;
        }
        return hd->next;
    }
};