[leetcode] Reverse Nodes in k-Group

贴这个主要是因为之前pat考试的时候（http://pat.zju.edu.cn/contests/pat-a-practise/1074）跪了，刚好这次A leetcode的时候解出来了。

题目描述：

Given a linked list, reverse the nodes of a linked list k at a time and return its modified 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个节点进行reverse，所以首先先遍历k个节点，

如果有，则reverse，没有则返回。

/**
 * 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 (k <= 1)
                        return head;

                ListNode *pre = head, *cur = head;

                int count = 1;
                for (; cur != NULL && count < k; ++count, cur = cur->next);

                // 如果剩余K个或者更多结点，则递归reverse剩余的
                if (count == k && cur != NULL) // Have more than k nodes, need to reverse
                {
                        //cout << pre->val << " " << cur->val << endl;
                        ListNode *nexthead = cur->next;
                        reverse(pre, cur);
                        // cur -> node1 -> node2 -> ... -> pre ->nexthead
                        head = cur;
                        pre->next = reverseKGroup(nexthead, k);
                }

                return head;
        }
        // reverse当前k个结点
        void reverse(ListNode *pre, ListNode *cur)
        {
                ListNode *newHead = pre, *temp;
                pre = pre->next;
                newHead->next = NULL;

                while(pre != cur)
                {
                        temp = pre;
                        pre = pre->next;
                        temp->next = newHead;
                        newHead = temp;
                }
                cur->next = newHead;
                newHead = cur;
        }
};